Submission #67624

#TimeUsernameProblemLanguageResultExecution timeMemory
67624Mamnoon_SiamPopeala (CEOI16_popeala)C++17
17 / 100
2073 ms2960 KiB
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> // #include <bits/extc++.h> using namespace std; #define debug(s) cout << #s << " = " << s << endl #define all(v) (v).begin(), (v).end() #define KeepUnique(v) (v).erase( unique(all(v)), v.end() ) #define MEMSET(a, val) memset(a, val, sizeof (a)) #define PB push_back #define endl '\n' typedef long long ll; inline int myrand(int l, int r) { int ret = rand(); ret <<= 15; ret ^= rand(); if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l; return ret; } template <typename F, typename S> ostream& operator << (ostream& os, const pair< F, S>& p) { return os<<"(" <<p.first<<", "<<p.second<<")"; } typedef pair<int, int> ii; template<typename T> using min_pq = std::priority_queue<T, vector<T>, greater<T> >; //int dx[] = {-1, +0, +1, +0}; //int dy[] = {+0, +1, +0, -1}; int n, t, s; ll pre[20005]; ll dp[53][20005]; ll bit[20005]; int32_t main () { // freopen("in", "r", stdin); cin >> n >> t >> s; for(int i = 1; i <= t; i++) { cin >> pre[i]; pre[i] += pre[i - 1]; } for(int i = 0; i < n; i++) { string s; cin >> s; for(int j = 0; j < t; j++) { if(s[j] - '0') bit[j + 1] |= (1LL << i); } } for(int i = 1; i <= s; i++) dp[i][0] = ~2U >> 1; for(int i = 1; i <= t; i++) dp[0][i] = ~2U >> 1; for(int i = 1; i <= s; i++) { for(int j = 1; j <= t; j++) { dp[i][j] = 2e9; ll cur = ~0; for(int k = j; k >= 1; k--) { cur &= bit[k]; dp[i][j] = min(dp[i][j], dp[i - 1][k - 1] + 1LL * __builtin_popcountll(cur) * (pre[j] - pre[k - 1])); } } } for(int i = 1; i <= s; i++) cout << dp[i][t] << endl; }

Compilation message (stderr)

popeala.cpp: In function 'int myrand(int, int)':
popeala.cpp:18:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
popeala.cpp:18:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...