oj.uz

Submission #800974

# Submission time Handle Problem Language Result Execution time Memory
800974 2023-08-02T03:21:08 Z jlallas384 Gondola (IOI14_gondola) C++17
55 / 100
 29 ms 4592 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]){
    set<int> used;
    int idx = 0;
    for(int i = 0; i < n; i++){
        if(used.count(inputSeq[i])) return 0;
        used.insert(inputSeq[i]);
        if(inputSeq[i] <= n){
            idx = i;
        }
    }
    int nd = inputSeq[idx];
    for(int i = 0; i < n; i++){
        int j = (idx + i) % n;
        if(inputSeq[j] <= n && inputSeq[j] != nd) return 0;
        nd++;
        if(nd > n) nd = 1;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int idx = -1;
    for(int i = 0; i < n; i++){
        if(gondolaSeq[i] <= n){
            idx = i;
            break;
        }
    }
    vector<int> st(n);
    int nd = (idx == -1 ? 1 : gondolaSeq[idx]);
    if(idx == -1) idx = 0;
    for(int i = 0; i < n; i++){
        st[(idx + i) % n] = nd++;
        if(nd > n) nd = 1;
    }
    vector<pair<int,int>> srt;
    for(int i = 0; i < n; i++){
        if(gondolaSeq[i] > n) srt.emplace_back(gondolaSeq[i], i);
    }
    sort(srt.begin(), srt.end());
    int l = 0;
    int c = n + 1;
    for(auto [v, i]: srt){
        replacementSeq[l++] = st[i];
        while(c < v){
            replacementSeq[l++] = c++;
        }
        c++;
    }
    return l;
}

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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 6 ms 680 KB Output is correct
8 Correct 20 ms 3928 KB Output is correct
9 Correct 6 ms 1364 KB Output is correct
10 Correct 23 ms 4504 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 6 ms 596 KB Output is correct
8 Correct 20 ms 3924 KB Output is correct
9 Correct 6 ms 1468 KB Output is correct
10 Correct 24 ms 4468 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 15 ms 2028 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 29 ms 4592 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 6 ms 1364 KB Output is correct
12 Correct 7 ms 1468 KB Output is correct
13 Correct 10 ms 1468 KB Output is correct
14 Correct 6 ms 1340 KB Output is correct
15 Correct 16 ms 2380 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -