# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63162 | khsoo01 | Popeala (CEOI16_popeala) | C++11 | 926 ms | 60120 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 X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll N = 55, T = 20005, inf = 1e12;
ll n, t, s, p[T], a[N][T], dt[N][T], pre[T][N], nxt[N][T];
char ipt[T];
vector<pll> pot[T];
ll getv (ll S, ll E) {
ll R = 0;
for(int i=1;i<=n;i++) {
if(a[i][E] - a[i][S-1] == E-S+1) R++;
}
return R;
}
int main()
{
scanf("%lld%lld%lld",&n,&t,&s);
for(int i=1;i<=t;i++) {
scanf("%lld",&p[i]);
p[i] += p[i-1];
}
for(int i=1;i<=n;i++) {
scanf("%s",ipt+1);
Compilation message (stderr)
# | 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... |