# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
722647 | Yell0 | Gondola (IOI14_gondola) | C++17 | 19 ms | 2300 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
typedef long long ll;
const int MOD=1e9+9;
int valid(int n,int inputSeq[]) {
int st=-1;
vector<int> ogIdx(n+2);
set<int> usedNew;
for(int i=0;i<n;++i) {
if(st<0&&inputSeq[i]<=n) {
st=i;
ogIdx[inputSeq[i]]=i;
for(int j=1;j<n;++j) ogIdx[(inputSeq[i]-1+j)%n+1]=j;
} else if(inputSeq[i]<=n) {
if(ogIdx[inputSeq[i]]!=i) return 0;
} else {
if(usedNew.count(inputSeq[i])) return 0;
usedNew.insert(inputSeq[i]);
}
}
return 1;
}
int replacement(int n,int gondolaSeq[],int replacementSeq[]) {
vector<pair<int,int>> news;
vector<int> og(n);
for(int i=0;i<n;++i) if(gondolaSeq[i]>n) news.push_back({gondolaSeq[i],i});
sort(news.begin(),news.end());
bool f=0;
for(int i=0;i<n;++i) {
if(gondolaSeq[i]<=n) {
f=1;
og[i]=gondolaSeq[i];
for(int j=1;j<n;++j) og[(i+j)%n]=(og[i]-1+j)%n+1;
break;
}
}
if(!f) for(int i=0;i<n;++i) og[i]=i+1;
int repi=0,currRep=n;
for(int i=0;i<news.size();++i) {
replacementSeq[repi++]=og[news[i].second];
++currRep;
while(currRep<news[i].first) replacementSeq[repi++]=currRep++;
}
return repi;
}
int countReplacement(int n,int inputSeq[]) {
if(!valid(n,inputSeq)) return 0;
vector<int> news;
for(int i=0;i<n;++i) if(inputSeq[i]>n) news.push_back(inputSeq[i]);
sort(news.begin(),news.end());
auto qpow=[&](ll x,int e) {
ll res=1,mult=x;
for(int i=0;1<<i<=e;++i) {
if((1LL<<i)&e) res=res*mult%MOD;
mult=mult*mult%MOD;
}
return res;
};
ll ans=(news.size()==n?n:1);
int prev=n;
for(int i=0;i<news.size();++i) {
ans=ans*qpow(news.size()-i,news[i]-prev-1)%MOD;
prev=news[i];
}
return ans%MOD;
}
컴파일 시 표준 에러 (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... |