제출 #1228721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1228721		AMel0n	Gondola (IOI14_gondola)	C++20	25 / 100	9 ms	3924 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

#include "gondola.h"

int valid(int n, int seq[]) {
    unordered_set<int> seen;
    pair<int,int> pr = {-1,-1};
    FOR(i, n) {
        if (seen.find(seq[i]) != seen.end()) return 0;
        seen.insert(seq[i]);
        if (seq[i] <= n) {
            if (pr.F != -1) {
                if (pr.F <= seq[i]) {
                    if (seq[i]-pr.F != i-pr.S) return 0;
                } else {
                    if (pr.F-seq[i] != n-(i-pr.S)) return 0;
                }
            }
            pr = {seq[i], i};
        }
    }
    return 1;
}



int replacement(int n, int gSeq[], int replacementSeq[]) {
    unordered_set<int> seen;
    int mx = 0;
    FOR(i, n) {
        seen.insert(gSeq[i]);
        mx = max(mx, gSeq[i]);
    }
    int i = 0;
    for(int g = 1; g <= mx; g++) {
        if (seen.find(g) == seen.end()) replacementSeq[i++] = g;
    }
    return i;
}




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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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