제출 #674700

#제출 시각아이디문제언어결과실행 시간메모리
674700Antekb수열 (BOI14_sequence)C++14
0 / 100
1079 ms4612 KiB
#include<bits/stdc++.h> //#pragma GCC optimize("Ofast") //#pragma GCC optimize("trapv") #define st first #define nd second #define pb push_back #define eb emplace_back #define pp(x) pop_back(x) #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; ///~~~~~~~~~~~~~~~~~~~~~~~~~~ template <typename H, typename T> ostream& operator<<(ostream& os, pair<H, T> m){ return os <<"("<< m.st<<", "<<m.nd<<")"; } template <typename H> ostream& operator<<(ostream& os, vector<H> V){ os<<"{"; for(int i=0; i<V.size(); i++){ if(i)os<<" "; os<<V[i]; } os<<"}"; return os; } void debug(){cerr<<"\n";} template <typename H, typename... T> void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);} #define deb(x...) cerr<<#x<<" = ";debug(x); ///~~~~~~~~~~~~~~~~~~~~~~~~~ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const int K=18, N=(1<<K), INF=1e9+5, mod=1e9+7, mod2=998244353; struct modint{ int n=0; modint(){} modint(ll x){ n=x%mod; if(n<0)n+=mod; } operator int(){ return n; } modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;} modint operator+=(modint a){return (*this)=(*this)+a;} modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;} modint operator-=(modint a){return (*this)=(*this)-a;} modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;} modint operator*=(modint a){return (*this)=(*this)*a;} modint operator^(const ll &m)const{ modint a(1); if(m==0)return a; if(m==1)return (*this); a=(*this)^(m/2); a*=a; return a*((*this)^(m&1)); } modint odw(){ return (*this)^((ll)mod-2); } modint operator/(modint a){return (*this)*a.odw();} modint operator/=(modint a){return (*this)=(*this)/a;} bool operator==(modint a){return a.n==n;} friend ostream& operator<<(ostream& os, modint m) { return os << m.n; } }; modint fact[N], fact2[N]; typedef vector<modint> vm; void factinit(){ fact[0]=1; for(int i=1; i<N; i++){ fact[i]=(fact[i-1]*modint(i))%mod; } fact2[N-1]=fact[N-1].odw(); for(int i=N-2; i>=0; i--){ fact2[i]=(fact2[i+1]*modint(i+1))%mod; } } modint npok(int _n, int _k){ return fact[_n]*fact2[_k]*fact2[_n-_k]; } ll solve(vector<int> V, bool b){ deb(V, b); int n=V.size(); if(n==0)return 1; if(n==1 && V[0]==0){ return 10*(!b); } if(n==1){ vi V2; for(int i=0; i<10; i++){ if(V[0]&(1<<i))V2.pb(i); } assert(V.size()); sor(V2); if(V2[0]==0){ if(V2.size()==1)V2.pb(1); swap(V2[0], V2[1]); } deb(V2); ll ans=0; for(int i:V2){ ans*=10; ans+=i; } deb(ans); return ans; } //deb(n, V); ll ans=1e18; for(int i=0; i<10; i++){ vector<int> V2; for(int j=0; j<n; j++){ if(i==j%10 || !V2.size())V2.pb(0); V2.back()|=V[j]&(~(1<<((j-i+10)%10))); } while(V2.size() && V2.back()==0)V2.pp(); deb(V, b, i, V2); if(V2!=V)ans=min(ans, 10*solve(V2, b|i)+(10-i)%10); if(V2==V && !b && i)ans=min(ans, 10*solve(V2, b|i)+(10-i)%10); deb(V, b, i, ans); } return ans; } int main(){ //factinit(); //BOOST; int n; cin>>n; vector<int> V(n); for(int i=0; i<n; ++i){ int x; cin>>x; V[i]=1<<x; } cout<<solve(V, 0); }

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In instantiation of 'std::ostream& operator<<(std::ostream&, std::vector<_Tp>) [with H = int; std::ostream = std::basic_ostream<char>]':
sequence.cpp:39:30:   required from 'void debug(H, T ...) [with H = std::vector<int>; T = {bool}]'
sequence.cpp:110:2:   required from here
sequence.cpp:29:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for(int i=0; i<V.size(); i++){
      |               ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...