제출 #1135746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135746		HasanV11010238	곤돌라 (IOI14_gondola)	C++20	10 / 100	0 ms	328 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
#define ll long long
using namespace std;
int valid(int n, int inputSeq[])
{
    map<int, int> ma;
    int mind = -1;
    for (int i = 0; i < n; i++){
        if (inputSeq[i] <= n){
            if (mind == -1 || inputSeq[i] < inputSeq[mind]){
                mind = i;
            }
        }
        if (ma[inputSeq[i]] > 0) return 0;
        ma[inputSeq[i]]++;
    }
    if (mind == -1) return 1;
    int va = inputSeq[mind];
    for (int i = 0; i < va - 1; i++){
        mind--;
        if (mind < 0) mind = n - 1;
    }
    for (int i = 0; i < n; i++){
        int no = (i + mind) % n;
    }
    return 1;
}


int replacement(int n, int go[], int rep[])
{
    if (!valid(n, go)) return 0;
    int mind = -1;
    for (int i = 0; i < n; i++){
        if (go[i] <= n){
            if (mind == -1 || go[i] < go[mind]){
                mind = i;
            }
        }
    }
    if (mind == -1) return 1;
    int va = go[mind];
    for (int i = 0; i < va - 1; i++){
        mind--;
        if (mind < 0) mind = n - 1;
    }
    vector<vector<int>> v; 
    for (int i = 0; i < n; i++){
        int no = (i + mind) % n;
        if (go[no] > n){
            v.push_back({go[no], i + 1});
        }
    }
    sort(v.begin(), v.end());
    int ind = 0, no = n + 1, cnt = 0;
    for (auto el : v){
        rep[ind] = el[1];
        el[1] = no;
        ind++;
        no++;
        cnt++;
        while (el[1] != el[0]){
            rep[ind] = no;
            el[1] = no;
            no++;
            ind++;
            cnt++;
        }
    }
    return cnt;
}
int countReplacement(int n, int inp[])
{
    if (!valid(n, inp)) return 0;
    return 1;
}

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