oj.uz

Submission #236956

# Submission time Handle Problem Language Result Execution time Memory
236956 2020-06-04T06:08:10 Z crossing0ver Gondola (IOI14_gondola) C++17
55 / 100
 41 ms 18424 KB 
#include<bits/stdc++.h>
#include "gondola.h"
using namespace std;
const int MAXN = 1E5+5;
int n,a[MAXN];
int valid(int n1, int inputSeq[]) {
	n = n1;
	int pos = -1;
	for (int i = 0; i < n; i++) {
		a[i] = inputSeq[i];
		if (a[i] <= n) 
			pos = i;
	}
	if (pos != -1) {
		int x = (a[pos] - pos - 1)%n;
		if (x <0) x+= n;	
		int b[MAXN];
		for (int i = 0; i < n; i++) {
			b[(x + i)%n] = a[i];
		}
		for (int i = 0;i < n; i++)
			a[i] = b[i];
	}
	set<int> s;
	for (int i = 0; i < n; i++) {
		if (a[i] < n) {
			if (a[i] != i + 1) return 0;
		}
		s.insert(a[i]);
	}
	if (s.size() != n) return 0;
	return 1;
}

bool cmp(int x,int y) {
	return a[x-1] < a[y-1];
}
int replacement(int n1, int gondolaSeq[], int replacementSeq[]){
	bool c = valid(n1,gondolaSeq);
	vector<int> v;
	for (int i = 0; i < n ;i++) {
		if (a[i] > n) {
			v.push_back(a[i]);
		}
	}
	sort (v.begin(),v.end());
	vector<int> b(n+1);
	vector<int> g;
	for (int i = 0; i < n; i++)
		if (a[i] <= n) b[a[i]] = 1;
		
	for (int i = 1; i <= n; i++) 
		if (!b[i]) {
		g.push_back(i);
	}
	int cnt = 0;
	int val = n+1;
	vector<bool> good(100000000);
	for (int i = 0; i < v.size(); i++)
		good [v[i]] = 1;
	sort(g.begin(),g.end(),cmp);
	if (v.size() == 0) return 0;
	int mx = v.back() + 1;
	  for (int i = 0;i < g.size(); i++) {
		while (!good[ g[i] ]) {
		replacementSeq[cnt] = g[i];
		g[i] = val;
		val++;	
		cnt++;
	}
	}
	return cnt;	
}
int countReplacement(int n, int inputSeq[]) { return 0;}
/* 
main() {
	int n;
	cin >> n;
	int inputseq[n];
	int s[100000];
	for (int i = 0;i  < n; i++)
		cin >> inputseq[i];
	cout << replacement(n,inputseq,s);
} */

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (s.size() != n) return 0;
      ~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:59:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++)
                  ~~^~~~~~~~~~
gondola.cpp:64:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0;i < g.size(); i++) {
                   ~~^~~~~~~~~~
gondola.cpp:39:7: warning: unused variable 'c' [-Wunused-variable]
  bool c = valid(n1,gondolaSeq);
       ^
gondola.cpp:63:6: warning: unused variable 'mx' [-Wunused-variable]
  int mx = v.back() + 1;
      ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 288 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 436 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 17 ms 2560 KB Output is correct
7 Correct 17 ms 1408 KB Output is correct
8 Correct 28 ms 4480 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 40 ms 5240 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 16 ms 2560 KB Output is correct
7 Correct 17 ms 1408 KB Output is correct
8 Correct 28 ms 4472 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 33 ms 5248 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 10 ms 768 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 18 ms 1280 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12544 KB Output is correct
2 Correct 10 ms 12672 KB Output is correct
3 Correct 10 ms 12544 KB Output is correct
4 Correct 10 ms 12544 KB Output is correct
5 Correct 11 ms 12576 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12544 KB Output is correct
2 Correct 10 ms 12544 KB Output is correct
3 Correct 11 ms 12544 KB Output is correct
4 Correct 10 ms 12544 KB Output is correct
5 Correct 10 ms 12544 KB Output is correct
6 Correct 10 ms 12544 KB Output is correct
7 Correct 11 ms 12672 KB Output is correct
8 Correct 11 ms 12672 KB Output is correct
9 Correct 11 ms 12544 KB Output is correct
10 Correct 11 ms 12544 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12544 KB Output is correct
2 Correct 12 ms 12416 KB Output is correct
3 Correct 10 ms 12544 KB Output is correct
4 Correct 11 ms 12544 KB Output is correct
5 Correct 12 ms 12544 KB Output is correct
6 Correct 10 ms 12544 KB Output is correct
7 Correct 11 ms 12672 KB Output is correct
8 Correct 11 ms 12544 KB Output is correct
9 Correct 11 ms 12556 KB Output is correct
10 Correct 12 ms 12584 KB Output is correct
11 Correct 37 ms 17664 KB Output is correct
12 Correct 41 ms 18424 KB Output is correct
13 Correct 38 ms 13984 KB Output is correct
14 Correct 37 ms 17656 KB Output is correct
15 Correct 36 ms 13924 KB Output is correct

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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