# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
261231 | 2020-08-11T15:06:33 Z | A02 | 곤돌라 (IOI14_gondola) | C++14 | 18 ms | 2300 KB |
#include "gondola.h" #include <algorithm> #include <set> #include <iostream> #include <vector> using namespace std; int valid(int n, int inputSeq[]) { vector<int> occurences (250001, 0); vector<int> reduced_sequence; for (int i = 0; i < n; i++){ if (inputSeq[i] <= n){ reduced_sequence.push_back(inputSeq[i]); //cout << i << ' ' << reduced_sequence[i] << endl; occurences[inputSeq[i]]++; } } for (int i = 0; i < occurences.size(); i++){ if (occurences[i] > 1){ return 0; } } if (reduced_sequence.size() == 0){ return 1; } int lowest = distance(reduced_sequence.begin(), min_element(reduced_sequence.begin(), reduced_sequence.end())); //cout << lowest << endl; int k = reduced_sequence.size(); for (int i = 0; i < k - 1; i++){ if (reduced_sequence[(i + lowest) % k] >= reduced_sequence[(i + lowest + 1) % k]){ //cout << i + lowest << endl; return 0; } } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1280 KB | Output is correct |
2 | Correct | 1 ms | 1280 KB | Output is correct |
3 | Correct | 1 ms | 1280 KB | Output is correct |
4 | Correct | 2 ms | 1280 KB | Output is correct |
5 | Correct | 1 ms | 1280 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1280 KB | Output is correct |
2 | Correct | 1 ms | 1280 KB | Output is correct |
3 | Correct | 2 ms | 1280 KB | Output is correct |
4 | Correct | 1 ms | 1280 KB | Output is correct |
5 | Correct | 2 ms | 1280 KB | Output is correct |
6 | Correct | 8 ms | 1792 KB | Output is correct |
7 | Correct | 16 ms | 2300 KB | Output is correct |
8 | Correct | 14 ms | 2172 KB | Output is correct |
9 | Correct | 5 ms | 1664 KB | Output is correct |
10 | Correct | 16 ms | 2300 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1280 KB | Output is correct |
2 | Correct | 1 ms | 1280 KB | Output is correct |
3 | Correct | 1 ms | 1280 KB | Output is correct |
4 | Correct | 2 ms | 1280 KB | Output is correct |
5 | Correct | 1 ms | 1280 KB | Output is correct |
6 | Correct | 8 ms | 1824 KB | Output is correct |
7 | Correct | 16 ms | 2300 KB | Output is correct |
8 | Correct | 14 ms | 2300 KB | Output is correct |
9 | Correct | 5 ms | 1664 KB | Output is correct |
10 | Correct | 18 ms | 2300 KB | Output is correct |
11 | Incorrect | 2 ms | 1280 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 416 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |