Submission #926819

# Submission time Handle Problem Language Result Execution time Memory
926819 2024-02-13T20:30:39 Z NintsiChkhaidze Gondola (IOI14_gondola) C++17
20 / 100
33 ms 6932 KB
#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
using namespace std;
int b[200005],c[200005],a[200005];

int valid(int n, int gondolaSeq[]){
	map <int,int> mp;
	
	int k = -1;
	for (int i=0;i<n;i++){
		a[i] = gondolaSeq[i];
		if (mp.find(a[i]) != mp.end()) return 0;
		mp[a[i]] = 1;
 		if (a[i] > n) continue;
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	if (k==-1) return 1;
		
	int m = 0;
	int st = a[k];
	for (int j = k; j < n; j++)
		if (a[j] <= n) b[++m] = a[j],c[m] = st + (j - k);
	
	for (int j = 0; j < k; j++)
		if (a[j] <= n) b[++m] = a[j],c[m] = st + (n - k) + j;
	
	for (int i = 1; i <= m; i++){
		if (b[i] != c[i]) return 0;
	}
  	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int k = -1;
	for (int i=0;i<n;i++){
		a[i] = gondolaSeq[i];
 		if (a[i] > n) continue;
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	if (k == -1) k=0;
		
	int st = a[k];
	for (int j = k; j < n; j++)
		b[j] = st + (j - k);
	
	for (int j = 0; j < k; j++)
		b[j] = st + (n - k) + j;
	
	int x = n+1,m = -1;
	vector <pair <int,int> > vec;
	for (int i=0;i<n;i++){
		if (gondolaSeq[i] > n) 
			vec.pb({gondolaSeq[i],i});
	}
	sort(vec.begin(),vec.end());
	
	for (int j=0;j<vec.size();j++){
		int final = vec[j].f,i = vec[j].s;
		
		int cur = b[i];
		while (cur != final){
			replacementSeq[++m] = cur;
			cur = x++;
		}
	}
	
	return m + 1;
}

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

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

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:65:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for (int j=0;j<vec.size();j++){
      |               ~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2648 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 10 ms 4440 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 19 ms 6236 KB Output is correct
9 Correct 7 ms 3672 KB Output is correct
10 Correct 24 ms 6876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 10 ms 4444 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 21 ms 6160 KB Output is correct
9 Correct 6 ms 3676 KB Output is correct
10 Correct 24 ms 6748 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 13 ms 4420 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 33 ms 6932 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2492 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2596 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 496 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -