제출 #58616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58616		RezwanArefin01	Gondola (IOI14_gondola)	C++17	100 / 100	87 ms	6192 KiB

gondola

#include <bits/stdc++.h> 
#include "gondola.h"
using namespace std; 

int valid(int n, int a[]) {
    int X, idx = -1;
    for(int i = 0; i < n; i++) {
        if(a[i] >= 1 && a[i] <= n) {
            X = a[i], idx = i; 
        }
    }
    set<int> st(a, a + n); 
    if(st.size() != n) return 0; 
    if(idx == -1) return 1; 
    for(int i = 0; i < n; i++) {
        if(a[i] >= 1 && a[i] <= n) {
            if((X + i - idx + n) % n != a[i] % n) 
                return 0;
        }
    } return 1; 
}

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

int replacement(int n, int a[], int res[]) {
    int l = 0, idx = -1, X; 
    for(int i = 0; i < n; i++) {
        if(1 <= a[i] && a[i] <= n) 
            idx = i, X = a[i]; 
    }
    int b[n];
    if(idx == -1) {
        for(int i = 0; i < n; i++) b[i] = i + 1; 
    } else { 
        for(int i = 0; i < n; i++) { 
            b[i] = (X + i - idx + n) % n; 
            if(b[i] == 0) b[i] = n;
        }
    } 
    vector<pair<int, int> > v; 
    for(int i = 0; i < n; i++) {
        if(a[i] > n) {
            v.emplace_back(a[i], b[i]); 
        }
    }
    sort(v.begin(), v.end()); 
    for(int i = 0; i < v.size(); i++) {
        while(l + n <  v[i].first) { 
            res[l++] = v[i].second; 
            v[i].second = l + n; 
        }
    } return l; 
}

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

const int mod = 1e9 + 9; 
typedef long long ll;

inline int Pow(int a, int p) {
	int ret = 1; while(p) {
		if(p & 1) ret = (ll) ret * a % mod;
		a = (ll) a * a % mod;
		p >>= 1;
	} return ret;
}
int countReplacement(int n, int a[]) {
    if(!valid(n, a)) return 0; 
    long long ans = 1; 
    vector<int> v;
    for(int i = 0; i < n; i++) 
        if(a[i] > n) v.push_back(a[i]); 
    sort(v.begin(), v.end()); 
    for(int i = 0; i < v.size(); i++) {
        int rem = v.size() - i; 
        int tot = v[i] - (i ? v[i - 1] + 1 : n + 1); 
        ans *= Pow(rem, tot); 
        ans %= mod; 
    } 
    if(v.size() == n) 
        ans = ans * n % mod; 
    return ans; 
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(st.size() != n) return 0; 
        ~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:47:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v.size(); i++) {
                    ~~^~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < v.size(); i++) {
                    ~~^~~~~~~~~~
gondola.cpp:80:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(v.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: 10 / 10