oj.uz

답안 #798652

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
798652 2023-07-30T22:28:39 Z Liudas 곤돌라 (IOI14_gondola) C++17
20 / 100
 25 ms 5752 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int N, int seq[]){
    vector<int> s(2 * N);
    set<int> ss;
    int val = true;
    for(int i = 0; i < N; i ++){
        ss.insert(seq[i]);
        s[i] = seq[i];
        s[i + N] = seq[i];
    }
    if(ss.size()!=N)val = false;
    int start = min_element(s.begin(), s.begin() + N) - s.begin();
    int k = *min_element(s.begin(), s.begin() + N);
    for(int i = start; i < start + N; i ++, k ++){
        if(s[i] <= N && s[i] != k){
            val = false;
        }
    }
    return val;
}
int replacement(int N, int seq[], int rseq[]){
    vector<int> s(2 * N);
    vector<pair<int, int>> arr(N);
    for(int i = 0; i < N; i ++){
        s[i] = seq[i];
        s[N+i] = seq[i];
    }
    int k = min_element(s.begin(), s.begin() + N) - s.begin();
    for(int i = k; i < k + N; i ++){
        arr[i-k] = {s[i], i - k + 1};
    }
    int p = 0;
    int last = N + 1;
    sort(arr.begin(), arr.end());
    for(int i = 0; i < N; i ++){
        if(arr[i].first > N){
            rseq[p++] = arr[i].second;
            for(;last < arr[i].first;){
                rseq[p++] = last++;
            }
        }
    }
    return p;
}
int countReplacement(int N, int seq[]){
    return 0;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:13:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   13 |     if(ss.size()!=N)val = false;
      |        ~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 8 ms 2644 KB Output is correct
7 Correct 20 ms 4684 KB Output is correct
8 Correct 15 ms 4832 KB Output is correct
9 Correct 5 ms 1748 KB Output is correct
10 Correct 22 ms 5564 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 308 KB Output is correct
6 Correct 8 ms 2628 KB Output is correct
7 Correct 24 ms 4696 KB Output is correct
8 Correct 15 ms 4820 KB Output is correct
9 Correct 5 ms 1748 KB Output is correct
10 Correct 21 ms 5620 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 308 KB Output is correct
13 Correct 10 ms 2556 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 25 ms 5752 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -