제출 #166960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166960		davitmarg	곤돌라 (IOI14_gondola)	C++17	20 / 100	53 ms	5232 KiB

gondola

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000009ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

#ifndef death
#include "gondola.h"
#endif

int valid(int n, int inputSeq[])
{
    vector<int> a, b;
    for (int i = 0; i < n; i++)
        a.PB(inputSeq[i]);
    b = a;
    for (int i = 0; i < n; i++)
    {
        if (a[i] > n)
            continue;
        for (int j = 0; j < n; j++)
            b[(a[i] - 1 + j) % n] = a[(i + j) % n];
        break;
    }
    a = b;
    map<int, int> used;
    for (int i = 0; i < n; i++)
    {
        if ((a[i] <= n && i + 1 != a[i]) || used[a[i]])
            return 0;
        used[a[i]] = 1;
    }
    return 1;
}

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

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

#ifdef death

int main()
{
    int N, A[102];
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> A[i];
    cout << valid(N, A) << endl;
    return 0;
}

#endif

/*

7
5 6 7 1 2 3 4


7
5 6 7 1 2 10 4 

*/

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