# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536947 | FatihSolak | Popeala (CEOI16_popeala) | C++17 | 714 ms | 249932 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>
#define T 20005
#define N 55
using namespace std;
int mini[T][N][N];
int st[T][N];
int dp[T][N];
int points[T];
int nxt[N][T];
void solve(){
int n,t,s;
cin >> n >> t >> s;
for(int i=1;i<=t;i++){
cin >> points[i];
points[i] += points[i-1];
}
for(int i=1;i<=n;i++){
string ss;
cin >> ss;
nxt[i][t+1] = t+1;
for(int j = t;j>=0;j--){
if(j && ss[j-1] == '0')
nxt[i][j] = j;
else nxt[i][j] = nxt[i][j+1];
}
}
for(int i=0;i<=t;i++){
vector<int> v;
for(int j = 1;j<=n;j++){
v.push_back(nxt[j][i]);
# | 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... |