# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80034 | pzdba | Doktor (COCI17_doktor) | C++14 | 1082 ms | 132096 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 pair<int, int> pii;
int a[500005];
int pref[500005], suff[500005];
map<int, map<int, int> > dp;
map<int, map<int, pii> > dp2;
map<int, map<int, int> >::iterator its2;
map<int, int>::iterator its;
int main(){
int n;
scanf("%d", &n);
for(int i=1;i<=n;i++){
scanf("%d", &a[i]);
if(i == a[i]) pref[i] = 1;
pref[i] += pref[i-1];
}
for(int i=n;i>=1;i--){
if(i == a[i]) suff[i] = 1;
suff[i] += suff[i+1];
}
int ans = 0;
for(int i=1;i<=n;i++){
int diff = a[i]-i;
if(diff == 0) ans++;
int s = 0, e = 0;
if(diff < 0) s = i+diff, e = i;
else s = i, e = i+diff;
int le = e-s+1;
diff += 2*i;
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |