oj.uz

답안 #780079

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780079 2023-07-12T06:32:18 Z Sohsoh84 곤돌라 (IOI14_gondola) C++17
20 / 100
 23 ms 4816 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

const int MAXN = 1e6 + 10;

int A[MAXN];

int valid(int n, int inputSeq[]) {
	int s = -1;
	for (int i = 0; i < n; i++) inputSeq[i]--;
	for (int i = 0; i < n; i++) {
		if (inputSeq[i] < n)
			s = i;
	}

	if (s == -1) return 0;
	
	int shift_val = (s - inputSeq[s] + n) % n;
	for (int j = 0; j < n; j++)
		A[j] = inputSeq[(j + shift_val) % n];

	set<int> st;
	for (int i = 0; i < n; i++) {
		if (A[i] < n)
			if (A[i] != i) return 0;
		else
			A[i] = i;

		st.insert(A[i]);
	}
	return st.size() == n;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	return -2;
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:29:6: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   29 |   if (A[i] < n)
      |      ^
gondola.cpp:36:19: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |  return st.size() == n;
      |         ~~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

Subtask #2
5.0 / 5.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 Correct 8 ms 2344 KB Output is correct
7 Correct 7 ms 960 KB Output is correct
8 Correct 18 ms 4308 KB Output is correct
9 Correct 5 ms 1492 KB Output is correct
10 Correct 23 ms 4812 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 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 2376 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 16 ms 4116 KB Output is correct
9 Correct 5 ms 1492 KB Output is correct
10 Correct 19 ms 4816 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 7 ms 1456 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -2 violates the range [0, 350000]
2 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 1 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 -