oj.uz

Submission #55586

# Submission time Handle Problem Language Result Execution time Memory
55586 2018-07-08T07:22:51 Z leejseo Gondola (IOI14_gondola) C++
55 / 100
 31 ms 2472 KB 
#include "gondola.h"
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;

#define UNDEF -1

typedef pair<int, int> pii;
long long mod = 1000000009;

int valid(int n, int inputSeq[])
{
	vector<int> L;
	L.resize(n);
	int temp;
	int shift = -1;
	for (int i=0; i<n; i++){
		L[i] = inputSeq[i];
		if (L[i] <= n){
			temp = (i-L[i]+n+1)%n;
			if (shift == UNDEF) shift = temp;
			else if (shift != temp) return 0;
		}
	}
	sort(L.begin(), L.end());
	for (int i=1; i<n; i++) if (L[i-1] == L[i]) return 0;
	L.clear();
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  int min_val = 1000000, min_index = -1;
	vector<pii> L;
	for (int i=0; i<n; i++){
		if (min_val > gondolaSeq[i]){
			min_index = i;
			min_val = gondolaSeq[i];
		} 
	}	
	bool b = (min_val > n);	
	for (int j=0; j<n; j++){
			int i = min_index + j;
			int c;
			if (b) c = j;
			else{
				c = (j + min_val)%n;
			}	
			L.push_back(pii(gondolaSeq[i%n], (c == 0 ? n : c)));
	}	
	sort(L.begin(), L.end());	
	int l = 0;
	for (int i=0; i<n; i++){		
		while (L[i].first != L[i].second){
			replacementSeq[l] = L[i].second;
			l++;
			L[i].second = n+l;
		}
	}	
	return l;
}

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

long long llpow(int a, int b){
	if (b%2 == 0) return (llpow(a, b/2) * llpow(a, b/2))%mod;
	return (llpow(a, b-1) * a) % mod;
}

int pow(int a, int b){
	return (int) llpow(a, b);
}

int countReplacement(int n, int inputSeq[])
{
  if (!valid(n, inputSeq)) return 0;
	int min_val = 1000000, min_index = -1;
	vector<pii> L;
	for (int i=0; i<n; i++){
		if (min_val > inputSeq[i]){
			min_index = i;
			min_val = inputSeq[i];
		} 
	}	
	bool b = (min_val > n);	
	for (int j=0; j<n; j++){
			int i = min_index + j;
			int c;
			if (b) c = j;
			else{
				c = (j + min_val)%n;
			}	
			L.push_back(pii(inputSeq[i%n], (c == 0 ? n : c)));
	}	
	sort(L.begin(), L.end());	
	int ans = 0;
	for (int i=0; i<n; i++){
		ans = 1;
	}
	return -1;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:99:6: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
  int ans = 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 476 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 484 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 3 ms 672 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 2 ms 672 KB Output is correct
6 Correct 9 ms 876 KB Output is correct
7 Correct 12 ms 1276 KB Output is correct
8 Correct 13 ms 1276 KB Output is correct
9 Correct 7 ms 1276 KB Output is correct
10 Correct 20 ms 1276 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1276 KB Output is correct
2 Correct 2 ms 1276 KB Output is correct
3 Correct 2 ms 1276 KB Output is correct
4 Correct 2 ms 1276 KB Output is correct
5 Correct 2 ms 1276 KB Output is correct
6 Correct 11 ms 1276 KB Output is correct
7 Correct 20 ms 1276 KB Output is correct
8 Correct 15 ms 1276 KB Output is correct
9 Correct 7 ms 1276 KB Output is correct
10 Correct 20 ms 1276 KB Output is correct
11 Correct 3 ms 1276 KB Output is correct
12 Correct 2 ms 1276 KB Output is correct
13 Correct 8 ms 1276 KB Output is correct
14 Correct 2 ms 1276 KB Output is correct
15 Correct 14 ms 1280 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 3 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 3 ms 1280 KB Output is correct
10 Correct 3 ms 1280 KB Output is correct
11 Correct 14 ms 2168 KB Output is correct
12 Correct 23 ms 2172 KB Output is correct
13 Correct 20 ms 2172 KB Output is correct
14 Correct 16 ms 2172 KB Output is correct
15 Correct 31 ms 2472 KB Output is correct

Subtask #7
0 / 5.0

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

Subtask #9
0 / 15.0

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