# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51826 | evpipis | Popeala (CEOI16_popeala) | C++14 | 1808 ms | 26632 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;
#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
typedef long long ll;
const int len = 2e4+5;
const ll inf = 1e15;
int po[len], can[55][len], n, s, t;
ll dp[55][len];
ii inter[55][len];
deque<pair<ll, int> > deq;
int val(int l, int r){
int ans = 0;
for (int i = 1; i <= n; i++)
if (can[i][r]-can[i][l-1] == r-l+1)
ans += po[r]-po[l-1];
return ans;
}
int cnt(int l, int r){
int ans = 0;
for (int i = 1; i <= n; i++)
if (can[i][r]-can[i][l-1] == r-l+1)
ans++;
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... |