제출 #389406

#제출 시각아이디문제언어결과실행 시간메모리
389406Pichon5곤돌라 (IOI14_gondola)C++17
60 / 100
48 ms4600 KiB
#include <bits/stdc++.h> #include "gondola.h" #pragma GCC optimize("O3") #define ll long long const ll M=1e9+7; using namespace std; int valid(int n, int inputSeq[]){ set<int> seen; for(int i = 0; i < n; i++){ if(seen.count(inputSeq[i])) return 0; seen.insert(inputSeq[i]); } int pos = -1, st; for(int i = 0; i < n; i++) if(inputSeq[i] <= n) pos = i, st = inputSeq[i]; if(pos == -1) return 1; for(int j = 0; j < n; j++, pos++, pos %= n){ if(inputSeq[pos] > n) continue; if(inputSeq[pos] != (st+j-1)%n+1) return 0; } return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]){ int l = 0, last = n, pos = -1, st; vector< pair<int, int> > q; vector<int> p(n); for(int i = 0; i < n; i++) if(gondolaSeq[i] <= n) pos = i, st = gondolaSeq[i]; if(pos == -1) for(int i = 0; i < n; i++) p[i] = i+1; else for(int i = 0; i < n; i++, pos++, pos %= n) p[pos] = (st+i-1)%n+1; for(int i = 0; i < n; i++) if(gondolaSeq[i] > n) q.push_back({gondolaSeq[i], i}); if(q.empty()) return 0; sort(q.begin(), q.end()); for(auto &t : q){ replacementSeq[l++] = p[t.second]; last++; while(last != t.first) replacementSeq[l++] = last++; } return l; } //---------------------- int countReplacement(int n, int inputSeq[]){ if(!valid(n, inputSeq)) return 0; vector<int> a(250001); ll s = 1, m = n; for(int i = 0; i < n; i++) a[inputSeq[i]]++; for(int i = 249999; i > n; i--) a[i] += a[i+1]; for(int i = n+1; i < 250000; i++){ if(!a[i]) break; if(a[i] == a[i+1]) s *= a[i], s %= M; } for(int i = 0; i < n; i++) if(inputSeq[i] <= n) m = 1; s *= m, s %= M; return s; } //number of subtask //n //3 1 4 //5 1 2 3 4 //2 3 4 9 6 7 1

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:16:16: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   16 |  int pos = -1, st;
      |                ^~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:29:33: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   29 |  int l = 0, last = n, pos = -1, st;
      |                                 ^~
#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...