제출 #55643

#제출 시각아이디문제언어결과실행 시간메모리
55643leejseo곤돌라 (IOI14_gondola)C++98
100 / 100
55 ms3164 KiB
#include "gondola.h" #include <vector> #include <algorithm> #include <utility> using namespace std; #define UNDEF -1 typedef pair<int, int> pii; long long mod = 1000000009; int valid(int n, int inputSeq[]) { vector<int> L; L.resize(n); int temp; int shift = -1; for (int i=0; i<n; i++){ L[i] = inputSeq[i]; if (L[i] <= n){ temp = (i-L[i]+n+1)%n; if (shift == UNDEF) shift = temp; else if (shift != temp) return 0; } } sort(L.begin(), L.end()); for (int i=1; i<n; i++) if (L[i-1] == L[i]) return 0; L.clear(); return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { int min_val = 1000000, min_index = -1; vector<pii> L; for (int i=0; i<n; i++){ if (min_val > gondolaSeq[i]){ min_index = i; min_val = gondolaSeq[i]; } } bool b = (min_val > n); for (int j=0; j<n; j++){ int i = min_index + j; int c; if (b) c = j; else{ c = (j + min_val)%n; } L.push_back(pii(gondolaSeq[i%n], (c == 0 ? n : c))); } sort(L.begin(), L.end()); int l = 0; for (int i=0; i<n; i++){ while (L[i].first != L[i].second){ replacementSeq[l] = L[i].second; l++; L[i].second = n+l; } } return l; } //---------------------- long long llpow(long long a, int b){ long long ans = 1; while(b){ if (b & 1) ans = (ans * a) % mod; a = (a*a)%mod; b >>=1; } return ans; } int countReplacement(int n, int inputSeq[]) { if (!valid(n, inputSeq)) return 0; int min_val = 1000000, min_index = -1; vector<int> L; for (int i=0; i<n; i++){ if (min_val > inputSeq[i]){ min_index = i; min_val = inputSeq[i]; } } bool b = (min_val > n); for (int i=0; i<n; i++){ if (inputSeq[i] > n) L.push_back(inputSeq[i]); } sort(L.begin(), L.end()); long long ans = 1; int m = L.size(); int k = n - m; for (int i=0; i<m; i++){ if (i == 0) { ans = (ans * llpow((long long) m, L[i]-n-1))%mod; continue; } ans = (ans * llpow((long long) m-i, L[i]-1-L[i-1]))%mod; } if (m == n) ans = (ans * n) % mod; return (int) ans; }

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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:82:25: warning: variable 'min_index' set but not used [-Wunused-but-set-variable]
  int min_val = 1000000, min_index = -1;
                         ^~~~~~~~~
gondola.cpp:90:7: warning: unused variable 'b' [-Wunused-variable]
  bool b = (min_val > n);
       ^
gondola.cpp:97:6: warning: unused variable 'k' [-Wunused-variable]
  int k = n - m;
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...