oj.uz

답안 #259835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
259835 2020-08-08T16:03:18 Z srj 곤돌라 (IOI14_gondola) C++14
10 / 100
 40 ms 5368 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[])
{
	map<int,int> pos;
  for(int i =0;i<n;i++){
  		if(inputSeq[i]<=n)
  			pos[inputSeq[i]] = i;
  }
  int sortSeq[n];
  memcpy(sortSeq,inputSeq,sizeof(sortSeq));
  sort(sortSeq,sortSeq+n);
  if(sortSeq[0]>n)
  	return 1;
  int smallval = sortSeq[0];
  int cur = pos[sortSeq[0]];
  for(int i =0;i<n;i++){
  	if(inputSeq[(cur+i)%n]!=smallval+i && inputSeq[cur+i]<=n){
  		// cout << smallval << endl;
  		// cout << i << endl;
  		return 0;
  	}
  }
  return 1;
}

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

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

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

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 19 ms 2560 KB Output is correct
7 Correct 39 ms 4600 KB Output is correct
8 Correct 31 ms 4736 KB Output is correct
9 Correct 9 ms 1664 KB Output is correct
10 Correct 37 ms 5300 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 17 ms 2560 KB Output is correct
7 Correct 40 ms 4536 KB Output is correct
8 Correct 28 ms 4600 KB Output is correct
9 Correct 11 ms 1664 KB Output is correct
10 Correct 37 ms 5368 KB Output is correct
11 Incorrect 1 ms 256 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #10
0 / 10.0

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