oj.uz

Submission #164991

# Submission time Handle Problem Language Result Execution time Memory
164991 2019-11-24T15:49:05 Z kostia244 Gondola (IOI14_gondola) C++17
10 / 100
 15 ms 1396 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
int valid(int n, int a[])
{
	vi v, b;
	int x = n+1;
	for(int i = 0; i < n; i++) {
		if(a[i]<=n)
			v.pb(a[i]), x = min(x, a[i]);
		else
			b.pb(a[i]);
	}
	sort(all(b));
	for(int i =1;i<b.size();i++)if(b[i]==b[i-1]) return 0;
	if(v.size()<2) return 1;
	int i = 0;
	while(v[i] != x) i++;
	int p = x;
	for(int j = (i+1)%v.size(); j != i; j = (j+1)%v.size()) {
		if(!(p<a[j])) return 0;
		p=a[j];
	}
	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:19:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i =1;i<b.size();i++)if(b[i]==b[i-1]) return 0;
               ~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 13 ms 860 KB Output is correct
7 Correct 14 ms 1368 KB Output is correct
8 Correct 12 ms 1268 KB Output is correct
9 Correct 5 ms 604 KB Output is correct
10 Correct 15 ms 1268 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 888 KB Output is correct
7 Correct 14 ms 1396 KB Output is correct
8 Correct 13 ms 1240 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 14 ms 1268 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Incorrect 2 ms 376 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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