# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
340486 | Kerim | 곤돌라 (IOI14_gondola) | C++17 | 72 ms | 6124 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "gondola.h"
#include "bits/stdc++.h"
#define MAXN 300009
#define INF 1000000009
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
map<int,int>mark;
int valid(int n, int arr[]){
mark.clear();int mn=INF,who,res=1;
for(int i=0;i<n;i++){
if(mark[arr[i]])return 0;
if(umin(mn,arr[i]))who=i;
mark[arr[i]]=1;
}
if(mn>n)return 1;
for(int i=0;i<n;i++)
res&=((arr[(who+i)%n]>n) or arr[(who+i)%n]==mn+i);
return res;
}
//----------------------
int vis[MAXN];
int replacement(int n, int arr[], int ans[]){
assert(valid(n,arr));
int mn=INF,mx=0,who,am;
for(int i=0;i<n;i++){
if(umin(mn,arr[i]))who=i;
umax(mx,arr[i]);
}
if(mx<=n)return 0;
if(mn>n)who=0,mn=1;
who=(who-(mn-1)+n)%n;
int last,res=0;
for(int i=0;i<n;i++){
int to=(who+i)%n;
if(arr[to]>n){
if(arr[to]==mx)last=i+1;
else vis[arr[to]]=i+1;
}
}
for(int i=n+1;i<=mx;i++){
if(!vis[i])ans[res++]=last,last=i;
else ans[res++]=vis[i];
}
return res;
}
//----------------------
int mod(ll x){
return (x%INF);
}
int Fe(int x,int y){
if(!y)return 1;
int h=Fe(x,y/2);
h=mod(h*1LL*h);
if(y&1)h=mod(h*1LL*x);
return h;
}
int countReplacement(int n, int arr[]){
if(!valid(n,arr))return 0;
sort(arr,arr+n);int ans=1,cnt=0;
for(int j=0;j<n;j++)cnt+=(arr[j]>n);
if(arr[0]>n)ans=mod(n*1LL*Fe(cnt,arr[0]-n-1)),cnt--;
for(int i=0;i<n-1;i++)if(arr[i+1]>n)ans=mod(ans*1LL*Fe(cnt--,arr[i+1]-max(n,arr[i])-1));
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |