oj.uz

답안 #1064466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064466 2024-08-18T13:05:42 Z wood 곤돌라 (IOI14_gondola) C++17
10 / 100
 7 ms 1780 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pb push_back

int valid(int n, int inputSeq[])
{
	vi small; set<int> big;
	for(int i = 0; i<n; i++){
		if(inputSeq[i]<n) small.pb(inputSeq[i]); 
		else big.insert(inputSeq[i]);
	}
	int bad = 0;
	for(int i = 0; i<small.size()-1; i++){
		bad+=small[i+1]<small[i];
	}
	bad+=small[n-1]>small[0];
	if(bad>1) return 0;
	if(big.empty()) return 1;
	int mex = n;
	while(big.count(mex)) {
		mex++;
	}
	if(mex<big.size()+n-1) return 0;
	return 1;
}

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

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:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(int i = 0; i<small.size()-1; i++){
      |                 ~^~~~~~~~~~~~~~~
gondola.cpp:25:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  if(mex<big.size()+n-1) return 0;
      |     ~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 444 KB Output is correct
6 Correct 3 ms 1212 KB Output is correct
7 Correct 6 ms 1748 KB Output is correct
8 Correct 5 ms 1752 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 7 ms 1780 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 440 KB Output is correct
6 Correct 3 ms 1116 KB Output is correct
7 Correct 7 ms 1752 KB Output is correct
8 Correct 6 ms 1752 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 6 ms 1752 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #9
0 / 15.0

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