Submission #775422

#	Time	Username	Problem	Language	Result	Execution time	Memory
775422		alvingogo	Gondola (IOI14_gondola)	C++14	10 / 100	7 ms	596 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
using namespace std;

int valid(int n, int inputSeq[])
{
    int x=-1;
    for(int i=0;i<n;i++){
        if(inputSeq[i]<=n){
            x=i;
        }  
    }
    if(x==-1){
        return 1;
    }
    for(int i=x,cnt=0;cnt<n;i=(i+1)%n,cnt++){
        if((inputSeq[i]-inputSeq[x]+n)%n!=(i-x+n)%n){
            return 0;
        }
    }
    return 1;
}

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

int replacement(int n, int gs[], int rs[])
{
    int x=-1;
    for(int i=0;i<n;i++){
        if(gs[i]<=n){
            x=i;
        }  
    }
    if(x==-1){
        x=0;
    }
    vector<pair<int,int> > g;
    for(int i=x,cnt=0,z=gs[x];cnt<n;i=(i+1)%n,cnt++,z=(z+1)%n+(n*(z==n-1))){
        if(gs[i]>n){
            g.push_back({gs[i],z});
        }
    }
    sort(g.begin(),g.end());
    for(auto h:g){
        cout << h.fs << " " << h.sc << '\n';
    }
    int nw=n+1,f=0;
    for(auto y:g){
        rs[f]=y.sc;
        f++;
        nw++;
        for(;nw<=y.fs;f++,nw++){
            rs[f]=nw-1;
        }
    }
    return f;
}

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

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10