oj.uz

Submission #900271

# Submission time Handle Problem Language Result Execution time Memory
900271 2024-01-08T03:29:51 Z Darren0724 Gondola (IOI14_gondola) C++17
55 / 100
 14 ms 2648 KB 
#include "gondola.h"
#include<bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
const int INF=1e9;
const int mod=1e9+9;
int valid(int n, int v[]){
	int mn=INF,idx=-1;
	vector<int> a(300000);
	for(int i=0;i<n;i++){
		a[v[i]]++;
		if(a[v[i]]>1){
			return 0;
		}
		if(v[i]<mn){
			idx=i;
			mn=v[i];
		}
	}
	if(mn>n){
		return 1;
	}
	for(int j=0;j<n;j++){
		int i=(j+idx)%n;
		if(v[i]<=n){
			if(v[i]!=mn+j){
				return 0;
			}
		}
	}
	return 1;
}

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

int replacement(int n, int v[], int ans[]){
	int mn=INF,idx=0,mx=-1;
	vector<int> a(300000,-1);
	for(int i=0;i<n;i++){
		a[v[i]]=i;
		if(v[i]<mn){
			idx=i;
			mn=v[i];
		}
	}
	vector<int> ori(n);
	if(mn>n){
		idx=0,mn=1;
	}
	for(int i=0;i<n;i++){
		ori[(idx+i)%n]=mn;
		mn++;
		if(mn>n){
			mn=1;
		}
	}
	int j=n+1,ptr=0;
	for(int i=n+1;i<300000;i++){
		if(a[i]!=-1){
			ans[ptr]=ori[a[i]];
			ptr++;
			while(j<i){
				ans[ptr]=j;
				j++;
				ptr++;
			}
			j++;
		}
	}
	return ptr;
}

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

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

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:37:19: warning: unused variable 'mx' [-Wunused-variable]
   37 |  int mn=INF,idx=0,mx=-1;
      |                   ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1468 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1624 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 5 ms 1876 KB Output is correct
7 Correct 7 ms 2396 KB Output is correct
8 Correct 6 ms 2140 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 7 ms 2392 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1880 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 4 ms 1736 KB Output is correct
7 Correct 7 ms 2396 KB Output is correct
8 Correct 6 ms 2136 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 7 ms 2396 KB Output is correct
11 Correct 1 ms 1628 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 4 ms 1884 KB Output is correct
14 Correct 1 ms 1628 KB Output is correct
15 Correct 7 ms 2396 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1624 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1880 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1496 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1468 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1628 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1464 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1624 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1464 KB Output is correct
11 Correct 7 ms 2500 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 9 ms 2140 KB Output is correct
14 Correct 7 ms 2536 KB Output is correct
15 Correct 14 ms 2396 KB Output is correct

Subtask #7
0 / 5.0

# 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 -

Subtask #8
0 / 15.0

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