Submission #96284

#TimeUsernameProblemLanguageResultExecution timeMemory
96284figter001Gondola (IOI14_gondola)C++14
100 / 100
77 ms6744 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxs = 3e5; const int maxn = 1e5; const int mod = 1e9+9; int o[maxn]; map<int,int> f; int valid(int n, int s[]){ int st = -1,mn = n+1; for(int i=0;i<n;i++){ if(f[s[i]])return 0; f[s[i]] = 1; if(s[i] < mn){ st = i; mn = s[i]; } } if(st == -1)return 1; for(int i=st;i<n;i++){ if(s[i] <= n && s[i] != mn)return 0; mn++; } for(int i=0;i<st;i++){ if(s[i] <= n && s[i] != mn)return 0; mn++; } return 1; } //---------------------- int replacement(int n, int s[], int rep[]){ int l=0; int st = -1,mn = n+1; vector<pair<int,int>> to; for(int i=0;i<n;i++){ if(s[i] <= mn){ st = i; mn = s[i]; } if(s[i] > n)to.push_back({s[i],i}); } sort(to.begin(),to.end()); if(st == -1){ st = 0; mn = 1; } for(int i=st;i<n;i++){ o[i] = mn++; mn%=(n+1); if(!mn)mn++; } for(int i=0;i<st;i++){ o[i] = mn++; mn%=(n+1); if(!mn)mn++; } int cur = n+1; for(int i=0;i<(int)to.size();i++){ int id = to[i].second; while(o[id] < to[i].first){ rep[l++] = o[id]; o[id] = cur; cur++; } } return l; } //---------------------- ll Pow(ll a,ll b){ if(!b)return 1; ll res = Pow(a,b/2); if(b%2)return ((res*res)%mod*a)%mod; return (res*res)%mod; } int countReplacement(int n, int s[]){ if(!valid(n,s))return 0; vector<int> v; for(int i=0;i<n;i++) if(s[i] > n) v.push_back(s[i]); sort(v.begin(),v.end()); int L = n + 1,sz = v.size(); ll ans = 1; for(int i=0;i<v.size();i++){ ans = (ans * Pow(sz,v[i] - L)) % mod; L = v[i] + 1; sz--; } if(v.size() == n)ans = (ans * n)%mod; return ans; }

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:94:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++){
              ~^~~~~~~~~
gondola.cpp:99:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(v.size() == n)ans = (ans * n)%mod;
     ~~~~~~~~~^~~~
#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...