oj.uz

Submission #819603

# Submission time Handle Problem Language Result Execution time Memory
819603 2023-08-10T12:04:09 Z devariaota Gondola (IOI14_gondola) C++17
20 / 100
 34 ms 5220 KB 
#include <bits/stdc++.h>
#include "gondola.h"
#define ll long long
#define mod 1000000007
using namespace std;

//~ int n;
//~ int inputSeq[1000];

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  return -1;
}

int countReplacement(int n, int inputSeq[]){
  int mx = *max_element(inputSeq,inputSeq+n);
  return mx-n;
}

int valid(int n,int inputSeq[]){
  int mn = INT_MAX;
  int id;
  map<int,int> cnt;
  for(int i = 0 ; i < n ; i++){
    cnt[inputSeq[i]]++;
    if( cnt[inputSeq[i]] > 1 ) return 0;
  }
  for(int i = 0 ; i < n ; i++){
    if( mn > inputSeq[i] ){
      mn = inputSeq[i];
      id = i;
    }
  }
  if( mn > n ) return 1;
  vector<int> v;
  mn--;
  id = (id-mn)%n+n;
  id %= n;
  for(int i =  id ; i < n ; i++) v.push_back(inputSeq[i]);
  for(int i = 0 ; i < id ; i++) v.push_back(inputSeq[i]);
  for(int i = 0 ; i < n ; i++){
    if( v[i] <= n && v[i] != i+1 ) return 0;
  }
  return 1;
}

//~ int main(){
  //~ ios_base::sync_with_stdio(false);
  //~ cin.tie(0);
  //~ cout.tie(0);
  //~ cin>>n;
  //~ for(int i = 0 ; i < n ; i++){
    //~ cin>>inputSeq[i];
  //~ }
  //~ cout<<valid(n,inputSeq)<<"\n";
//~ }

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:36:11: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
   36 |   id = (id-mn)%n+n;
      |        ~~~^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 13 ms 2516 KB Output is correct
7 Correct 8 ms 668 KB Output is correct
8 Correct 22 ms 4552 KB Output is correct
9 Correct 6 ms 1640 KB Output is correct
10 Correct 25 ms 5100 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 11 ms 2524 KB Output is correct
7 Correct 8 ms 596 KB Output is correct
8 Correct 23 ms 4476 KB Output is correct
9 Correct 6 ms 1620 KB Output is correct
10 Correct 25 ms 5172 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 14 ms 2464 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 34 ms 5220 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -