# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082667 | _callmelucian | Popeala (CEOI16_popeala) | C++14 | 44 ms | 860 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;
#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())
const int mn = 2e4 + 4;
int dp[2][mn], pts[mn];
bool solved[55][mn];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, T, S; cin >> n >> T >> S;
for (int i = 1; i <= T; i++) cin >> pts[i];
for (int i = 1; i <= n; i++) {
string s; cin >> s;
for (int j = 1; j <= T; j++) solved[i][j] = (s[j - 1] == '1');
}
for (int sub = 1; sub <= S; sub++) {
int t = sub & 1;
for (int j = 1; j <= T; j++) dp[t][j] = INT_MAX;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |