# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
473167 | MamdouhN | Doktor (COCI17_doktor) | C++17 | 603 ms | 34308 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 int long long
#define endl "\n"
map<pair<int,int>,int>idk;
main()
{
int n;
cin>>n;
int ar[n];
int doingnothing=0;
for(int i=0;i<n;i++)
{
cin>>ar[i];
if(ar[i]==i+1)doingnothing++;
int x = min(ar[i]-1,i);
int y = max(ar[i]-1,i);
int dist = min(x - 0 , n - y-1);
//cout<<x-dist<<" "<<y+dist<<endl;
idk[{ x-dist , y+dist }]++;
}
int x = 0;
pair<int,int>ans;
for(auto v:idk)
{
if(v.second>x)
{
x = v.second;
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... |