oj.uz

Submission #253312

# Submission time Handle Problem Language Result Execution time Memory
253312 2020-07-27T16:54:25 Z eohomegrownapps Gondola (IOI14_gondola) C++14
55 / 100
 22 ms 2424 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
    vector<bool> seen(250002,false);
    int mnv = 250002;
    int mnind = -1;
    for (int i = 0; i<n; i++){
        if (seen[inputSeq[i]]){
            return 0;
        }
        seen[inputSeq[i]]=true;
        if (mnv>inputSeq[i]){
            mnv=inputSeq[i];
            mnind=i;
        }
    }
    if (mnv>n){
        return 1;
    }
    mnv++;
    for (int i = (mnind+1)%n; i!=mnind; i=(i+1)%n){
        if (1<=inputSeq[i]&&inputSeq[i]<=n){
            if (mnv!=inputSeq[i]){
                return 0;
            }
        }
        mnv++;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    vector<pair<int,int>> gondind;
    int oneind = 0;
    for (int i = 0; i<n; i++){
        if (gondolaSeq[i]<n){
            oneind=(i+n-(gondolaSeq[i]-1))%n;
            break;
        }
    }
    for (int i = 0; i<n; i++){
        if (gondolaSeq[i]>=n){
            gondind.push_back({gondolaSeq[i],i});
        }
    }
    vector<int> gondolas(n);
    
    int gptr = oneind;
    int incr = 0;
    do {
        gondolas[gptr]=incr;
        gptr++;incr++;
        gptr%=n;
    } while (gptr!=oneind);

    sort(gondind.begin(),gondind.end());
    int ptr = 0;
    int gprev = n;
    int nextgondola = n;
    for (auto g : gondind){
        for (int h = gprev; h<g.first; h++){
            //replace gondola at index g.second
            replacementSeq[ptr]=gondolas[g.second]+1;
            ptr++;
            gondolas[g.second]=nextgondola;
            nextgondola++;
        }
        gprev=g.first;
    }
    return ptr;
}

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

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 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 0 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 13 ms 640 KB Output is correct
8 Correct 11 ms 640 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 12 ms 768 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 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 0 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 15 ms 768 KB Output is correct
8 Correct 11 ms 640 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 14 ms 640 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 14 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 13 ms 1408 KB Output is correct
12 Correct 13 ms 1536 KB Output is correct
13 Correct 16 ms 1544 KB Output is correct
14 Correct 13 ms 1408 KB Output is correct
15 Correct 22 ms 2424 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 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 256 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 256 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 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -