oj.uz

답안 #799024

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
799024 2023-07-31T08:48:14 Z FatihSolak 곤돌라 (IOI14_gondola) C++17
25 / 100
 27 ms 4860 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> get(int n,int inputSeq[]){
	int pos = 0;
	for(int i = 0;i<n;i++){
		if(inputSeq[i] <= n){
			pos = (i + 1 - inputSeq[i] + n)%n;
		}
	}
	vector<int> ret;
	for(int i = pos;i < n;i++){
		ret.push_back(inputSeq[i]);
	}
	for(int i = 0;i<pos;i++){
		ret.push_back(inputSeq[i]);
	}
	return ret;
}
int valid(int n, int inputSeq[]){
	vector<int> inp = get(n,inputSeq);
	set<int> s;
	for(int i = 0;i<n;i++){
		s.insert(inp[i]);
		if(inp[i] <= n && inp[i] != i + 1){
			return 0;
		}
	}
	if(s.size() != n)	
		return 0;
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	vector<int> inp = get(n,gondolaSeq);
	map<int,int> mp;
	int maxi = 0;
	for(int i = 0;i<n;i++){
		if(inp[i] > n){
			mp[inp[i]] = i;
			if(inp[maxi] < inp[i])
				maxi = i;
		}
	}
	int l = 0;
	int tmp = inp[maxi];
	inp[maxi] = maxi + 1;
	for(int i = n + 1;i <= tmp;i++){
		if(mp.count(i) && mp[i] != maxi){
			replacementSeq[l++] = mp[i] + 1;
		}
		else{
			replacementSeq[l++] = inp[maxi];
		}
	}
	return l;
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:29:14: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |  if(s.size() != n)
      |     ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 2256 KB Output is correct
7 Correct 7 ms 1232 KB Output is correct
8 Correct 16 ms 4172 KB Output is correct
9 Correct 5 ms 1492 KB Output is correct
10 Correct 19 ms 4860 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 11 ms 2312 KB Output is correct
7 Correct 7 ms 1232 KB Output is correct
8 Correct 17 ms 4200 KB Output is correct
9 Correct 5 ms 1492 KB Output is correct
10 Correct 27 ms 4832 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 7 ms 1232 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -