oj.uz

Submission #259838

# Submission time Handle Problem Language Result Execution time Memory
259838 2020-08-08T16:12:25 Z srj Gondola (IOI14_gondola) C++14
20 / 100
 59 ms 5496 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[])
{
	map<int,int> pos;
  for(int i =0;i<n;i++){
  		if(pos.find(inputSeq[i])!=pos.end())
  			return 0;	
  			pos[inputSeq[i]] = i;
  }
  int sortSeq[n];
  memcpy(sortSeq,inputSeq,sizeof(sortSeq));
  sort(sortSeq,sortSeq+n);
  if(sortSeq[0]>n)
  	return 1;
  int smallval = sortSeq[0];
  int cur = pos[sortSeq[0]];
  for(int i =0;i<n;i++){
  	if(inputSeq[(cur+i)%n]!=smallval+i && inputSeq[(cur+i)%n]<=n){
  		// cout << smallval << endl;
  		// cout << i << endl;
  		return 0;
  	}
  }
  return 1;
}

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

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

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:9:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(pos.find(inputSeq[i])!=pos.end())
     ^~
gondola.cpp:11:6: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
      pos[inputSeq[i]] = i;
      ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 18 ms 2432 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 34 ms 4224 KB Output is correct
9 Correct 12 ms 1536 KB Output is correct
10 Correct 45 ms 4984 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 19 ms 2432 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 37 ms 4224 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 44 ms 4856 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 25 ms 2432 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 59 ms 5496 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Integer -2 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 384 KB Integer -2 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 256 KB Integer -2 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 256 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 384 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 1 ms 256 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 0 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -