# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
254528 | 2020-07-30T07:51:31 Z | b00n0rp | 곤돌라 (IOI14_gondola) | C++17 | 61 ms | 6008 KB |
#include "gondola.h" #include<bits/stdc++.h> using namespace std; #define ll long long int valid(int n, int inputSeq[]){ set<int> s; for(int i = 0; i < n; i ++){ s.insert(inputSeq[i]); } if(s.size() != n) return 0; for(int i = 0; i < n; i ++){ if(inputSeq[i] <= n){ for(int j = i+1; j != i; j = (j+1)%n){ if(inputSeq[j] > n) continue; if(inputSeq[j] != ((inputSeq[i]+(j-i)+n-1)%n)+1) return 0; } return 1; } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- const ll MOD = 1000000009; ll power(int x,int y){ if(y == 0) return 1; if(y == 1) return x; ll cur = power(x,y/2); cur = (cur*cur)%MOD; if(y%2) cur = (cur*x)%MOD; return cur; } int countReplacement(int n, int inputSeq[]){ if(!valid(n,inputSeq)) return 0; ll ans = 1; int cur = 0; vector<int> v; for(int i = 0; i < n; i ++){ if(inputSeq[i] <= n) continue; v.push_back(inputSeq[i]); } if(v.empty()) return 1; sort(v.begin(),v.end()); if(v.size() == n) ans = n; ans = (ans*power(v.size(),v[0]-n-1))%MOD; for(int i = 1; i < v.size(); i ++){ ans = (ans*power(v.size()-i,v[i]-v[i-1]-1))%MOD; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 1 ms | 328 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 0 ms | 256 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Correct | 13 ms | 2176 KB | Output is correct |
7 | Correct | 36 ms | 3704 KB | Output is correct |
8 | Correct | 25 ms | 3968 KB | Output is correct |
9 | Correct | 8 ms | 1536 KB | Output is correct |
10 | Correct | 31 ms | 4608 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
6 | Correct | 13 ms | 2176 KB | Output is correct |
7 | Correct | 31 ms | 3712 KB | Output is correct |
8 | Correct | 25 ms | 3968 KB | Output is correct |
9 | Correct | 8 ms | 1536 KB | Output is correct |
10 | Correct | 29 ms | 4608 KB | Output is correct |
11 | Correct | 0 ms | 256 KB | Output is correct |
12 | Correct | 0 ms | 384 KB | Output is correct |
13 | Correct | 16 ms | 2048 KB | Output is correct |
14 | Correct | 1 ms | 384 KB | Output is correct |
15 | Correct | 42 ms | 4728 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 0 ms | 256 KB | Output is correct |
7 | Correct | 0 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 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 | 0 ms | 384 KB | Output is correct |
6 | Correct | 0 ms | 384 KB | Output is correct |
7 | Correct | 0 ms | 384 KB | Output is correct |
8 | Correct | 0 ms | 384 KB | Output is correct |
9 | Correct | 46 ms | 4608 KB | Output is correct |
10 | Correct | 33 ms | 3832 KB | Output is correct |
11 | Correct | 12 ms | 1664 KB | Output is correct |
12 | Correct | 15 ms | 1920 KB | Output is correct |
13 | Correct | 4 ms | 640 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 256 KB | Output is correct |
8 | Correct | 0 ms | 384 KB | Output is correct |
9 | Correct | 41 ms | 4472 KB | Output is correct |
10 | Correct | 35 ms | 3832 KB | Output is correct |
11 | Correct | 12 ms | 1536 KB | Output is correct |
12 | Correct | 15 ms | 1920 KB | Output is correct |
13 | Correct | 3 ms | 640 KB | Output is correct |
14 | Correct | 52 ms | 5432 KB | Output is correct |
15 | Correct | 61 ms | 6008 KB | Output is correct |
16 | Correct | 10 ms | 1408 KB | Output is correct |
17 | Correct | 40 ms | 4216 KB | Output is correct |
18 | Correct | 21 ms | 2432 KB | Output is correct |