oj.uz

Submission #434684

# Submission time Handle Problem Language Result Execution time Memory
434684 2021-06-21T14:46:38 Z Supersonic Gondola (IOI14_gondola) C++14
55 / 100
 25 ms 2252 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int n;bool u[250001];
int o(int a,int b){return (a+b)<=n?(a+b):(a+b)-n;}
int valid(int an, int inputSeq[]){
  n=an;int g=-1;
  for(int i=0;i<n;i++){if(inputSeq[i]<=n)g=i;if(u[inputSeq[i]])return 0;u[inputSeq[i]]=1;}
  if(g==-1)return 1;
  for(int i=g;i<n;i++)if(inputSeq[i]<=n&&inputSeq[i]!=o(inputSeq[g],i-g))return 0;
  for(int i=0;i<g;i++)if(inputSeq[i]<=n&&inputSeq[i]!=o(inputSeq[g],n-g+i))return 0;
  return 1;
}

//----------------------

int replacement(int an, int gondolaSeq[], int replacementSeq[]){
  n=an;vector<pair<int,int>> g;
  int e=-1;
  for(int i=0;i<n;i++)if(gondolaSeq[i]<=n){e=i;break;}
  if(e==-1){
    for(int i=0;i<n;i++)g.push_back({gondolaSeq[i],i+1});
  }
  else{
    for(int i=e;i<n;i++)g.push_back({gondolaSeq[i],o(gondolaSeq[e],i-e)});
    for(int i=0;i<e;i++)g.push_back({gondolaSeq[i],o(gondolaSeq[e],n-e+i)});
  }
  sort(g.begin(),g.end());
  int c=n+1,r=0;
  for(auto i:g){
    if(i.first==i.second)continue;
    //cerr<<i.first<<':'<<i.second<<endl;
    replacementSeq[r]=i.second;r++;
    for(;c<i.first;c++){
      replacementSeq[r]=c;r++;
    }c++;
  }
  //for(int i=0;i<r;i++)cerr<<replacementSeq[i]<<' ';cerr<<endl;
  return r;
}

//----------------------

int countReplacement(int an, int inputSeq[]){
  n=an;
  return -3;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 6 ms 460 KB Output is correct
7 Correct 10 ms 716 KB Output is correct
8 Correct 9 ms 564 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 10 ms 644 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 5 ms 460 KB Output is correct
7 Correct 10 ms 656 KB Output is correct
8 Correct 9 ms 588 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 10 ms 636 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 5 ms 588 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 11 ms 716 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 13 ms 2160 KB Output is correct
12 Correct 20 ms 2244 KB Output is correct
13 Correct 16 ms 1420 KB Output is correct
14 Correct 12 ms 2168 KB Output is correct
15 Correct 25 ms 2252 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -