이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef int64_t lld;
typedef pair<int, int> pii;
typedef long double ld;
int valid(int n, int inputSeq[]) {
set<int> uses;
for(int i = 0; i < n; i++)if(inputSeq[i] <= n){
rotate(inputSeq, inputSeq+i, inputSeq+n);
if(inputSeq[0] != 1) rotate(inputSeq, inputSeq + (n-inputSeq[0]+1), inputSeq + n);
break;
}
for(int i = 0; i < n; i++)
if(inputSeq[i] == i+1) continue;
else if(inputSeq[i] <= n)return 0; else if(uses.count(inputSeq[i])) return 0; else uses.insert(inputSeq[i]);
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
map<int, int> mp;
for(int i = 0; i < n; i++)if(gondolaSeq[i] <= n){
rotate(gondolaSeq, gondolaSeq+i, gondolaSeq+n);
if(gondolaSeq[0] != 1) rotate(gondolaSeq, gondolaSeq + (n-gondolaSeq[0]+1), gondolaSeq + n);
break;
}
for(int i = 0; i < n; i++)if(gondolaSeq[i] > n)mp[gondolaSeq[i]] = i+1;
int cur = 0;
for(auto i: mp){
int l = i.ss;
while(cur+n < i.ff)
replacementSeq[cur++] = l, l = n+cur;
}
return cur;
}
//----------------------
const int mod = 1000000007;
inline int fpow(int a, int b){
lld ans = 1;
do if(b&1) ans = ans*a%mod;
while(a = (lld)a*a%mod, b>>=1);
return ans;
}
int countReplacement(int n, int inputSeq[]) {
vector<int> v;
if(!valid(n, inputSeq))return 0;
for(int i = 0; i < n; i++)if(inputSeq[i] > n)v.pb(inputSeq[i]);
sort(all(v));
if(v.size() != n){
lld ans = 1;
for(int i = 0; i < (int)v.size()-1; i++)
ans = ans*fpow((int)v.size()-i, (v[i+1]-v[i]-1))%mod;
return ans;
}else{
return -1;
}
}
컴파일 시 표준 에러 (stderr) 메시지
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:59:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
59 | if(v.size() != n){
| ~~~~~~~~~^~~~
# | 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... |