제출 #410945

#제출 시각아이디문제언어결과실행 시간메모리
410945MDario곤돌라 (IOI14_gondola)C++11
25 / 100
35 ms4936 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; #define F first #define S second const ll mod=1e9+7; ll qpow(ll xf, ll yf){ if(yf==0)return 1; if(yf&1)return (qpow(xf, yf-1)*xf)%mod; return qpow((xf*xf)%mod, yf/2); } int valid(int n, int a[]){ map<int, int>m; int c=0; for(int i=0; i<n; i++){ if(m[a[i]]){ return 0; } m[a[i]]=1; if(a[i]<=n){ if(c==0){ c=(a[i]-i+n-1)%n+1; } else if((a[i]-i+n-1)%n+1!=c){ return 0; } } } return 1; } //---------------------- int replacement(int n, int a[], int replacementSeq[]){ vector<pair<int, int>> v; int c=0; for(int i=0; i<n; i++){ if(a[i]<=n)c=(a[i]-i+n-1)%n+1; } if(c==0){ for(int i=0; i<n; i++){ v.push_back({a[i], i+1}); } } else{ for(int i=0; i<n; i++){ v.push_back({a[i], (c+i+1)%n}); } } sort(v.begin(), v.end()); c=n+1; for(int i=0; i<n; i++){ while(v[i].F>v[i].S){ replacementSeq[c-n-1]=v[i].S; v[i].S=c; c++; } } return c-n-1; } //---------------------- int countReplacement(int n, int a[]){ if(!valid(n, a))return 0; vector<ll> v; ll c=n+1, c1=0; for(int i=0; i<n; i++){ if(a[i]>n)v.push_back(a[i]); } sort(v.begin(), v.end()); c1=v.size(); ll r=1; for(int i=0; i<c1; i++){ r=(r*qpow(c1-i, v[i]-c)); c=v[i]+1; } return r; }
#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...