이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n ,int* a){
set<int> el ;
for(int i=0;i<n;i++) el.insert(a[i]) ;
if(el.size()!=n) return 0 ;
bool flg= 0 ;
for(int i=0;i<n;i++){
if(a[i]>n) continue;
for(int j=i;j<n+i;j++){
if(a[j%n]>n) continue ;
if(a[j%n]==((a[i]+j-i)<=n?a[i]+j-i:a[i]+j-i-n)) continue ;
return 0;
}
break ;
}
return 1 ;
}
int replacement(int n , int* a , int* ans){
/* map<int,int> occ ;
for(int i=0;i<n;i++) occ[a[i]]=i ;
int res = 0 ;
int start = n+1 , mx = 0 ;
for(int i=0;i<n;i++) mx =max(mx,a[i]) ;
if(mx<=n) return 0 ;
int i = 0 ;
int j= 0;
while(1){
if(occ.count(start)==0){
ans[i]=j;
}
else{
ans[i]=
}
if(start==mx) break ;
++start,++i ;
}
*/
return 1;
}
int countReplacement(int n,int* a){
const int md = 1e9+9 ;
if(valid(n,a)==0) return 0 ;
#define int long long
int spots = 0 ;
for(int i=0;i<n;i++) spots+=(a[i]>n) ;
int ans = (spots==n?n:1), mx = 0 ;
for(int i=0;i<n;i++) mx = max(mx,(int)a[i]) ;
set<int> vis ;
for(int i=0;i<n;i++) if(a[i]>n)vis.insert(a[i]) ;
int last = n;
function<int(int,int)> be=[](int b ,int e){
int ans =1;
while(e){
if(e&1) ans*=b;
b*=b,e/=2;
ans%=md,b%=md ;
}
return ans;
} ;
//cout << ans << ndl ;
for(int x: vis)
(ans*=be(spots,(x-last-1)))%=md,--spots,last = x ;
// cout << last << " " << x << " " <<spots << " " << be(spots,(x-last-1)) << endl ;
#undef int
int hey = ans ;
return hey;
}
/*int main(){
int a[2] = {3,4} ;
cout << countReplacement(2,a);
return 0 ;
}*/
컴파일 시 표준 에러 (stderr) 메시지
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:7:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
7 | if(el.size()!=n) return 0 ;
| ~~~~~~~~~^~~
gondola.cpp:8:10: warning: unused variable 'flg' [-Wunused-variable]
8 | bool flg= 0 ;
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |