Submission #335354

#	Time	Username	Problem	Language	Result	Execution time	Memory
335354		blue	Gondola (IOI14_gondola)	C++11	10 / 100	16 ms	620 KiB

gondola

#include "gondola.h"
#include <iostream>
#include <set>
using namespace std;

int valid(int n, int inputSeq[])
{
    set<int> S;
    int temp = n+1;
    for(int i = 0; i < n; i++) if(inputSeq[i] <= n)
    {
        temp = inputSeq[i];
        break;
        if(S.find(temp) != S.end()) return 0;
        S.insert(temp);
    }
    if(temp == n+1) return 1;

    for(int i = 0; i < n; i++) if(inputSeq[i] <= n)
    {
        inputSeq[i] = (inputSeq[i] - temp + n) % n;
    }

    temp = -1;
    for(int i = 0; i < n; i++)
    {
        if(inputSeq[i] > n) continue;
        if(temp != -1 && inputSeq[i] <= inputSeq[temp]) return 0;
        temp = i;
    }

    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    return 0;
}

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

• 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