Submission #1985255
Source Code Expand
#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; } // これを使うならば、tieとかを消して!!
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9+7)
int main(void) {
ll H, W; cin >> H >> W;
vector<string> b(H);
rep(i, H) {
string s; cin >> s;
b[i] = s;
}
ll ret = 0;
rep(w, W-1) {
// cout << w << " ########################" << endl;
// w, w+1
ll c[301][301] = {};
ll x = 0, y = 0;
rep(_, 2) {
rep(i, H) {
x = i, y = 0;
if (_) swap(x, y);
rep(j, 301) {
ll xx = x + 1, yy = y + 1;
if (!(xx <= H && yy <= H)) break;
c[xx][yy] = c[x][y] + (b[x][w] == b[y][w+1]);
x++, y++;
}
}
}
/*
rep(i, H+1) {
rep(j, H+1) {
cout << c[i][j] << " ";
}
cout << endl;
}
*/
ll dp[301][301] = {};
rep(i, 301) rep(j, 301) dp[i][j] = INF;
dp[H][H] = 0;
for (int i = 300; i >= 0; i--) for (int j = 300; j >= 0; j--) {
if (i+1<=H)
chmin(dp[i][j], dp[i+1][j] + c[i+1][j]);
if (j+1<=H)
chmin(dp[i][j], dp[i][j+1] + c[i][j+1]);
}
/*
rep(i, H+1) {
rep(j, H+1) {
cout << dp[i][j] << " ";
}
cout << endl;
}
*/
ret += dp[0][0];
}
cout << ret << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Friction |
User |
hamko |
Language |
C++14 (GCC 5.4.1) |
Score |
800 |
Code Size |
6909 Byte |
Status |
AC |
Exec Time |
242 ms |
Memory |
1788 KB |
Compile Error
./Main.cpp: In function ‘void vizGraph(vvll&, int, std::string)’:
./Main.cpp:41:478: warning: ignoring return value of ‘int system(const char*)’, declared with attribute warn_unused_result [-Wunused-result]
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
...
Judge Result
Set Name |
Sample |
Subtask |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
500 / 500 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt |
Subtask |
0_000.txt, 0_001.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 2_023.txt, 2_024.txt, 2_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
3 ms |
1788 KB |
0_001.txt |
AC |
2 ms |
1660 KB |
0_002.txt |
AC |
2 ms |
1660 KB |
0_003.txt |
AC |
3 ms |
1660 KB |
0_004.txt |
AC |
4 ms |
1660 KB |
1_005.txt |
AC |
2 ms |
1660 KB |
1_006.txt |
AC |
3 ms |
1660 KB |
1_007.txt |
AC |
3 ms |
1660 KB |
1_008.txt |
AC |
3 ms |
1660 KB |
1_009.txt |
AC |
3 ms |
1660 KB |
1_010.txt |
AC |
3 ms |
1660 KB |
1_011.txt |
AC |
3 ms |
1660 KB |
1_012.txt |
AC |
3 ms |
1660 KB |
1_013.txt |
AC |
3 ms |
1660 KB |
1_014.txt |
AC |
3 ms |
1660 KB |
1_015.txt |
AC |
3 ms |
1660 KB |
1_016.txt |
AC |
3 ms |
1660 KB |
1_017.txt |
AC |
2 ms |
1660 KB |
1_018.txt |
AC |
3 ms |
1660 KB |
1_019.txt |
AC |
3 ms |
1660 KB |
1_020.txt |
AC |
3 ms |
1660 KB |
1_021.txt |
AC |
3 ms |
1660 KB |
1_022.txt |
AC |
3 ms |
1660 KB |
2_023.txt |
AC |
63 ms |
1660 KB |
2_024.txt |
AC |
227 ms |
1788 KB |
2_025.txt |
AC |
228 ms |
1788 KB |
2_026.txt |
AC |
228 ms |
1788 KB |
2_027.txt |
AC |
219 ms |
1788 KB |
2_028.txt |
AC |
227 ms |
1788 KB |
2_029.txt |
AC |
71 ms |
1660 KB |
2_030.txt |
AC |
227 ms |
1788 KB |
2_031.txt |
AC |
58 ms |
1660 KB |
2_032.txt |
AC |
237 ms |
1788 KB |
2_033.txt |
AC |
92 ms |
1788 KB |
2_034.txt |
AC |
238 ms |
1788 KB |
2_035.txt |
AC |
138 ms |
1788 KB |
2_036.txt |
AC |
239 ms |
1788 KB |
2_037.txt |
AC |
13 ms |
1788 KB |
2_038.txt |
AC |
242 ms |
1788 KB |
2_039.txt |
AC |
17 ms |
1660 KB |
2_040.txt |
AC |
240 ms |
1788 KB |