oj.uz

답안 #254509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254509 2020-07-30T07:25:25 Z b00n0rp 곤돌라 (IOI14_gondola) C++17
20 / 100
 12 ms 640 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long

int valid(int n, int inputSeq[]){
	for(int i = 0; i < n; i ++){
		// cout << i << " " << inputSeq[i] << " " << inputSeq[(i+1)%n] << endl;
		if(inputSeq[(i+1)%n]-inputSeq[i] != 1 and inputSeq[(i+1)%n]-inputSeq[i] != 1-n) return 0;
	}
	return 1;
}

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

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

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

const ll MOD = 1000000009;

int countReplacement(int n, int inputSeq[]){
	int mx = inputSeq[0],mn = inputSeq[0];
	for(int i = 1; i < n; i ++){
		mx = max(mx,inputSeq[i]);
		mn = min(mn,inputSeq[i]);
	}
	if(mn > n){
		ll ans = 1;
		for(int i = 1; i <= n; i ++){
			ans = (ans*i)%MOD;
		}
		return ans;
	}
	else assert(0 == 1);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 9 ms 640 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 10 ms 640 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 9 ms 640 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 11 ms 640 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 12 ms 640 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -