oj.uz

답안 #1064585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064585 2024-08-18T14:57:54 Z sunboi 곤돌라 (IOI14_gondola) C++17
25 / 100
 26 ms 5860 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
 
 
 
int valid(int n, int inputSeq[]){
    vector<int> a;
    int mn = 1e6;
    set<int> val;
    for (int i = 0; i < n; i++){
        mn = min(mn, inputSeq[i]);
        val.insert(inputSeq[i]);
    }
    for (int i = 0; i < n; i++){
        if (inputSeq[i] == mn) a.push_back(mn);
        else if (!a.empty()){
            a.push_back(inputSeq[i]);
        }
        
    }
    
    for (int i = 0; i < n; i++){
        if (inputSeq[i] == mn) break;
        a.push_back(inputSeq[i]);
    }
    
    
    int cnt = a[0];
    int f = 1;
    for (int i = 0; i < n; i++){
        if (cnt == a[i] || a[i] >= n + 1) {
            cnt++;
            continue;
        }
        
        f = 0;
    }
    if ((int)(val.size()) != n) f = 0;
    return f;
}
 
 
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    vector<int> a;
    int mn = 1e6;
    for (int i = 0; i < n; i++){
        mn = min(mn, gondolaSeq[i]);
    }
    for (int i = 0; i < n; i++){
        if (gondolaSeq[i] == mn) a.push_back(mn);
        else if (!a.empty()){
            a.push_back(gondolaSeq[i]);
        }
        
    }
    
    for (int i = 0; i < n; i++){
        if (gondolaSeq[i] == mn) break;
        a.push_back(gondolaSeq[i]);
    }
    
    
    int cnt = a[0];
    set<pair<int, int>> repla;
    
    for (int i = 0; i < n; i++){
        if (cnt == n + 1) cnt = 1;
        
        if (cnt == a[i]) {
            cnt++;
            continue;
        }else{
            repla.insert({a[i], cnt});
            cnt++;
        }
    }
    
    int l = 0;
    int cur = n + 1;
    for (auto x : repla){
        //cout << x.first << ' ' << x.second << endl;
        replacementSeq[l] = x.second;
        l++;
        while(cur < x.first){
            replacementSeq[l] = cur;
            l++;
            cur++;
        }
        cur++;
    }
    return l;
}


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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2872 KB Output is correct
7 Correct 22 ms 4828 KB Output is correct
8 Correct 14 ms 5080 KB Output is correct
9 Correct 5 ms 1884 KB Output is correct
10 Correct 19 ms 5684 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2908 KB Output is correct
7 Correct 21 ms 4836 KB Output is correct
8 Correct 14 ms 5080 KB Output is correct
9 Correct 8 ms 1892 KB Output is correct
10 Correct 22 ms 5588 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 10 ms 2648 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 26 ms 5860 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Integer 4357 violates the range [1, 72]
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Integer 4357 violates the range [1, 72]
9 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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