Submission #297234

#	Time	Username	Problem	Language	Result	Execution time	Memory
297234		miss_robot	Gondola (IOI14_gondola)	C++14	55 / 100	50 ms	4728 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

#pragma GCC optimize("O3")

using namespace std;

int valid(int n, int inputSeq[]){
	set<int> seen;
	for(int i = 0; i < n; i++){
		if(seen.count(inputSeq[i])) return 0;
		seen.insert(inputSeq[i]);
	}
	int pos = -1, st;
	for(int i = 0; i < n; i++) if(inputSeq[i] <= n) pos = i, st = inputSeq[i];
	if(pos == -1) return 1;
	for(int j = 0; j < n; j++, pos++, pos %= n){
		if(inputSeq[pos] > n) continue;
		if(inputSeq[pos] != (st+j-1)%n+1) return 0;
	}
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	int l = 0, last = n, pos = -1, st;
	vector< pair<int, int> > q;
	vector<int> p(n);
	for(int i = 0; i < n; i++) if(gondolaSeq[i] <= n) pos = i, st = gondolaSeq[i];
	if(pos == -1) for(int i = 0; i < n; i++) p[i] = i+1;
	else for(int i = 0; i < n; i++, pos++, pos %= n) p[pos] = (st+i-1)%n+1;
	for(int i = 0; i < n; i++) if(gondolaSeq[i] > n) q.push_back({gondolaSeq[i], i});
	if(q.empty()) return 0;
	sort(q.begin(), q.end());
	for(auto &t : q){
		replacementSeq[l++] = p[t.second];
		last++;
		while(last != t.first) replacementSeq[l++] = last++;
	}
	return l;
}

int countReplacement(int n, int inputSeq[]){
}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:43:1: warning: no return statement in function returning non-void [-Wreturn-type]
   43 | }
      | ^
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:14:16: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   14 |  int pos = -1, st;
      |                ^~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:25:33: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   25 |  int l = 0, last = n, pos = -1, st;
      |                                 ^~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10