# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341722 | phathnv | 조교 (CEOI16_popeala) | C++11 | 291 ms | 10732 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;
const int T = 20001;
const int N = 51;
const int S = 51;
const int INF = 2e9 + 10;
int n, t, s, p[T], dp[S][T], last[T][N], minVal[N];
string a[N];
void ReadInput(){
cin >> n >> t >> s;
for(int i = 1; i <= t; i++)
cin >> p[i];
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] = '*' + a[i];
}
}
void Solve(){
for(int i = 1; i <= t; i++)
p[i] += p[i - 1];
for(int i = 1; i <= t; i++)
for(int j = 1; j <= n; j++)
last[i][j] = (a[j][i] == '0'? i : last[i - 1][j]);
# | 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... |