제출 #219145

#제출 시각아이디문제언어결과실행 시간메모리
219145summitwei곤돌라 (IOI14_gondola)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> //#include <gondola.h> using namespace std; typedef vector<int> vi; typedef vector<pair<int, int> > vpii; typedef pair<int, int> pii; typedef long long ll; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef vector<ll> vll; #define INF 0x3f3f3f3f #define MOD 1000000009LL #define EPSILON 0.00001 #define f first #define s second #define pb push_back #define mp make_pair #define FOR(i, a, b) for (ll i=(a); i<=(signed)(b); i++) #define F0R(i, a) for (ll i=0; i<(signed)(a); i++) #define RFOR(i, a, b) for (ll i=(a); i >= b; i--) #define MN 100005 int rep[MN*2]; int valid(int n, int inputSeq[]){ F0R(i, n) rep[i] = rep[i+n] = inputSeq[i]; int loc = min_element(rep, rep+2*n)-rep; F0R(i, n) inputSeq[i] = rep[i+loc]; set<int> hmm; int v = -1; if(inputSeq[0] <= n) v = inputSeq[0]; F0R(i, n){ if(hmm.count(rep[i])) return 0; hmm.insert(rep[i]); if(inputSeq[i]<=n && inputSeq[i]-i != v) return 0; } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]){ //return 0; valid(n, gondolaSeq); map<int, int> ree; int v = 1; if(gondolaSeq[0] <= n) v = gondolaSeq[0]; F0R(i, n){ if(gondolaSeq[i] > n) ree[gondolaSeq[i]] = i+v>n?i+v-n:i+v; } if(ree.empty()){ return 0; } int mx = (--ree.end())->f; int cur = (--ree.end())->s; FOR(i, n+1, mx){ if(ree[i] == 0){ replacementSeq[i-n-1] = cur; cur = i; } else if(i == mx){ replacementSeq[i-n-1] = cur; } else{ replacementSeq[i-n-1] = ree[i]; } } return mx-n; } ll modExp(ll b, ll ex){ ll prod = 1; while(ex > 0){ if(ex % 2 == 0){ b = (b * b) % MOD; ex /= 2; } else{ prod = (prod*b) % MOD; ex--; } } return prod; } int countReplacement(int n, int inputSeq[]){ if(!valid(n, inputSeq)) return 0; map<int, int> ree; int v = 1; if(inputSeq[0] <= n) v = inputSeq[0]; F0R(i, n){ if(inputSeq[i] > n) ree[inputSeq[i]] = i+v>n?i+v-n:i+v; } if(ree.empty()) return 1; int mx = (--ree.end())->f; int amt = ree.size(); ll ans = 1; /*if(inputSeq[0] > n){ FOR(i, 1, n) ans = (ans*i)%MOD; }*/ if(inputSeq[0] > n) ans = n; /*FOR(i, n+1, mx){ if(ree[i] == 0){ ans = (ans*amt)%MOD; } else{ --amt; } }*/ int prev = n; for(auto u : ree){ ans = (ans*modExp(amt, u.f-prev-1))%MOD; prev = u.f; --amt; } return (int)ans; } int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int a[n]; F0R(i, n) cin >> a[i]; cout << countReplacement(n, a) << "\n"; return 0; }

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:88:9: warning: unused variable 'mx' [-Wunused-variable]
     int mx = (--ree.end())->f;
         ^~
/tmp/ccP5ZLHq.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccyzrv5D.o:gondola.cpp:(.text.startup+0x0): first defined here
/tmp/ccP5ZLHq.o: In function `main':
grader.cpp:(.text.startup+0xc3): undefined reference to `countReplacement'
grader.cpp:(.text.startup+0xe2): undefined reference to `valid'
grader.cpp:(.text.startup+0x106): undefined reference to `replacement'
collect2: error: ld returned 1 exit status