oj.uz

Submission #16434

# Submission time Handle Problem Language Result Execution time Memory
16434 2015-08-25T02:32:45 Z atomzeno Gondola (IOI14_gondola) C++
55 / 100
 30 ms 6356 KB 
#include "gondola.h"
#include<algorithm>
using namespace std;
#define MX 250001
int d[MX],check[MX];
int l,ind;
int valid(int n, int inputSeq[]){
    int i,cnt=0,ind;
    for(i=0;i<=250000;i++){
        check[i]=0;
    }
    for(i=0;i<n;i++){
        if(inputSeq[i]<=n){
            cnt=1;
            ind=(inputSeq[i]-1-i)+n;
            ind%=n;
            break;
        }
    }
    for(i=0;i<n;i++){
        check[inputSeq[i]]++;
        if(check[inputSeq[i]]>=2){return 0;}
    }
    if(cnt==0){return 1;}
    for(i=0;i<n;i++){
        d[(ind+i)%n]=inputSeq[i];
    }
    for(i=0;i<n;i++){
        if(d[i]<=n&&d[i]!=(i+1)){
            return 0;
        }
    }
    return 1;
}
struct DT{
    int x,y;
    bool operator<(const DT&r)const{
        return r.x>x;
    }
}make[MX];
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int ll=0,o=n,flag=0,indin,i,j;
    for(i=0;i<n;i++){
        if(gondolaSeq[i]<=n){
            flag=1;
            indin=gondolaSeq[i];
            break;
        }
    }
    if(flag==0){indin=1;}
    for(j=i;j<i+n;j++){
        make[j%n].x=gondolaSeq[j%n];
        if(indin>n){indin-=n;}
        make[j%n].y=indin++;
    }
    sort(make,make+n);
    for(i=0;i<n;){
        if(make[i].y>=make[i].x){
            i++;
            continue;
        }
        replacementSeq[ll++]=make[i].y;
        make[i].y=++o;
    }
    return ll;
}

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

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6356 KB Output is correct
2 Correct 0 ms 6356 KB Output is correct
3 Correct 0 ms 6356 KB Output is correct
4 Correct 0 ms 6356 KB Output is correct
5 Correct 0 ms 6356 KB Output is correct
6 Correct 3 ms 6356 KB Output is correct
7 Correct 10 ms 6356 KB Output is correct
8 Correct 7 ms 6356 KB Output is correct
9 Correct 0 ms 6356 KB Output is correct
10 Correct 13 ms 6356 KB Output is correct
11 Correct 0 ms 6356 KB Output is correct
12 Correct 0 ms 6356 KB Output is correct
13 Correct 0 ms 6356 KB Output is correct
14 Correct 0 ms 6356 KB Output is correct
15 Correct 15 ms 6356 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6356 KB Output is correct
2 Correct 0 ms 6356 KB Output is correct
3 Correct 0 ms 6356 KB Output is correct
4 Correct 0 ms 6356 KB Output is correct
5 Correct 0 ms 6356 KB Output is correct
6 Correct 0 ms 6356 KB Output is correct
7 Correct 0 ms 6356 KB Output is correct
8 Correct 0 ms 6356 KB Output is correct
9 Correct 0 ms 6356 KB Output is correct
10 Correct 0 ms 6356 KB Output is correct
11 Correct 19 ms 6356 KB Output is correct
12 Correct 13 ms 6356 KB Output is correct
13 Correct 0 ms 6356 KB Output is correct
14 Correct 14 ms 6356 KB Output is correct
15 Correct 30 ms 6356 KB Output is correct

Subtask #7
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 6356 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 6356 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 6356 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 6356 KB Output isn't correct - Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -