제출 #250683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
250683		hhh07	곤돌라 (IOI14_gondola)	C++14	90 / 100	25 ms	2932 KiB

gondola

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <set>
#include <cmath>
#include <climits>
#include <cstring>
#include <stdio.h>
#include <assert.h>
#include "gondola.h"
 
using namespace std;
 
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;

ll MOD = 1e9 + 9;

ll stepen(ll x, int st){
    ll res = 1;
    while(st > 0){
        if (st&1)
            res = (1LL)*(res*x)%MOD;
        x = (1LL)*(x*x)%MOD;
        st /= 2;
    }
    return res;
}

int valid(int n, int x[]){
    int j = -1;
    for (int i = 0; i < n; i++){
        if (x[i] > n)
            continue;
        j = i;
        break;
    }
    vector<bool> visited(250001, 0);
    for (int i = 0; i < n; i++){
        if (visited[x[i]])
            return false;
        visited[x[i]] = true;
        if (j > i){
            int moze = x[j] - (j - i);
            if (moze < 1)
                moze += n;
            if (x[i] <= n && moze != x[i]){
                return false;
            }
        }
        else{
            int moze = x[j] + (i - j);
            if (moze > n)
                moze -= n;
            if (x[i] <= n && moze != x[i]){
                return false;
            }
        }
    }
    return true;
}

int replacement(int n, int x[], int y[]){
    vector<ii> t;
    int j = 0;
    for (int i = 0; i < n; i++){
        if (x[i] > n)
            t.push_back(make_pair(x[i], i));
        else
            j = i;
    }
    
    sort(t.begin(), t.end());
    if (t.size() == n)
        x[0] = 1;
    for (int i = 0; i < n; i++){
        if (j > i){
            int moze = x[j] - (j - i);
            if (moze < 1)
                moze += n;
            x[i] = moze;
        }
        else{
            int moze = x[j] + (i - j);
            if (moze > n)
                moze -= n;
            x[i] = moze;
        }
    }
    vi res;
    int k = n;
    for (int i = 0; i < t.size(); i++){
        int curr = t[i].first, idx = t[i].second;
        res.push_back(x[idx]);
        for (int j = k + 1; j < curr; j++)
            res.push_back(j);
        k = curr;
    }
    for (int i = 0; i < res.size(); i++)
        y[i] = res[i];
    return res.size();
}


int countReplacement(int n, int x[]){
    bool k = valid(n, x);
    if (!k)
        return 0;
    vi t;
    for (int i = 0; i < n; i++)
        if (x[i] > n)
            t.push_back(x[i]);

    sort(t.begin(), t.end());
    ll res = 1;
    int prev = n;
    for (int i = 0; i < t.size(); i++){
        res *= stepen(t.size() - i, t[i] - prev - 1);
        res = res%MOD;
        prev = t[i];
    }
    if (t.size() == n){
        res *= n;
        res = res%MOD;
    }
    return res;
}

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:77:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (t.size() == n)
         ~~~~~~~~~^~~~
gondola.cpp:95:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < t.size(); i++){
                     ~~^~~~~~~~~~
gondola.cpp:102:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < res.size(); i++)
                     ~~^~~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:120:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < t.size(); i++){
                     ~~^~~~~~~~~~
gondola.cpp:125:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (t.size() == 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: 15 / 15
• Subtask 10: 0 / 10