Submission #396799

#	Time	Username	Problem	Language	Result	Execution time	Memory
396799		ly20	Gondola (IOI14_gondola)	C++17	0 / 100	1 ms	204 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int seq[])
{
    bool vl = true;
    int id0 = n;
    map <int, int> freq;
    for(int i = 0; i < n; i++) {
        freq[seq[i]]++;
        if(freq[seq[i]] > 1) vl = false;
        if(seq[i] > n) continue;
        if(id0 == n) {
            id0 = seq[i] - i;
        }
        else {
            if(id0 != seq[i] - i) vl = false;
        }
    }
    if(vl) return 1;
    else return 0;
}

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

int replacement(int n, int seq[], int resp[])
{
    return -2;
}

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 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