제출 #107794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107794		FiloSanza	곤돌라 (IOI14_gondola)	C++14	75 / 100	54 ms	4600 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

int valid(int N, int inputSeq[])
{
    long long ind = -1, x = -1;
	for(long long i = 0; i < N; i++) {
		if(inputSeq[i] <= N) {
			ind = i;
			x = inputSeq[i];
			break;
		}
	}
	for(long long i = ind + 1; i < N; i++) {
		if(inputSeq[i] <= N && (x + i - ind - 1) % N + 1 != inputSeq[i])
			return 0;
	}

    set<long long> s;
    for(long long i=0; i<N; i++) s.insert(inputSeq[i]);
    if(s.size() != N) return 0;
    return 1;
}

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

int replacement(int N, int gondolaSeq[], int replacementSeq[])
{
    long long cont = 0;
    vector<long long> seq;
    vector<pair<long long, long long>> s;
    vector<long long> v;

    for(long long i=0; i<N; i++) 
        if(gondolaSeq[i] <= N)
            v.push_back(gondolaSeq[i]);

    sort(v.begin(), v.end());

    if(!v.empty()){
        deque<long long> q;
        for(long long i=0; i<N; i++) q.push_back(gondolaSeq[i]);

        while(q.front() != v.front()){
            q.push_front(q.back());
            q.pop_back();
        }

        for(long long i=1; i<v.front(); i++){
            q.push_front(q.back());
            q.pop_back();
        }
        
        while(!q.empty()){
            seq.push_back(q.front());
            q.pop_front();
        }
    }
    else{
        for(long long i=0; i<N; i++) seq.push_back(gondolaSeq[i]);
    }
    
    for(long long i=0; i<N; i++){
        if(seq[i] >= N)
            s.push_back({seq[i], i+1});
    }

    sort(s.begin(), s.end());

    if(s.empty()) return 0;

    long long nxt = N+1;
    for(auto i : s){
        long long to = i.second;
        while(nxt <= i.first){
            replacementSeq[cont++] = to;
            to = nxt;
            nxt++;
        }
    }

    return cont;
}

//----------------------
const long long MOD = 1e9+9;

long long power(long long b, long long e){
    long long res = 1;
    for(long long i=0; i<e; i++) res = (1LL * res*b)%MOD;
    return res % MOD;
}

int countReplacement(int N, int gondolaSeq[])
{
    if(valid(N, gondolaSeq) == 0) return 0;

    long long maxi = *max_element(gondolaSeq, gondolaSeq+N);
    vector<long long> v;
    for(long long i=0; i<N; i++) if(gondolaSeq[i] > N) v.push_back(gondolaSeq[i]);
    sort(v.begin(), v.end());
    long long curr = N;

    long long ans = 1;
    for(long long i=0; i<v.size(); i++){
        ans = (1LL * ans * (long long)power(v.size() - i, v[i] - curr - 1)) % MOD;
        curr = v[i];
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:23:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size() != N) return 0;
        ~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:107:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(long long i=0; i<v.size(); i++){
                        ~^~~~~~~~~
gondola.cpp:100:15: warning: unused variable 'maxi' [-Wunused-variable]
     long long maxi = *max_element(gondolaSeq, gondolaSeq+N);
               ^~~~

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