結果
問題 | No.2519 Coins in Array |
ユーザー |
|
提出日時 | 2023-10-27 22:07:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 342 ms / 2,000 ms |
コード長 | 3,877 bytes |
コンパイル時間 | 3,807 ms |
コンパイル使用メモリ | 261,416 KB |
最終ジャッジ日時 | 2025-02-17 15:05:16 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 37 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;typedef long long int ll;typedef long double ld;typedef vector<ll> vi;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vvvi> vvvvi;typedef vector<bool> vb;typedef vector<vb> vvb;typedef vector<vvb> vvvb;typedef vector<vvvb> vvvvb;typedef pair<ll,ll> pi;typedef pair<ll,pi> ppi;typedef pair<ll,ppi> pppi;typedef pair<ll,pppi> ppppi;#define FOR(i,l,r) for(ll i=l;i<r;i++)#define REP(i,n) FOR(i,0,n)#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)#define RREP(i,n) RFOR(i,0,n)#define ALL(x) x.begin(),x.end()#define F first#define S second#define BS(A,x) binary_search(ALL(A),x)#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())#define COU(A,x) (UB(A,x)-LB(A,x))#define sz(c) ((ll)(c).size())/*#include<boost/multiprecision/cpp_int.hpp>namespace mp=boost::multiprecision;using Bint=mp::cpp_int;*/template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}vi fast_mod_convolution(vi&a,vi&b,ll mod){const ll m1=167772161,m2=469762049,m3=1224736769;const ll m1_inv_m2=inv_mod(m1,m2);const ll m12_inv_m3=inv_mod(m1*m2,m3);const ll m12_mod=m1*m2%mod;auto x=convolution<m1>(a,b);auto y=convolution<m2>(a,b);auto z=convolution<m3>(a,b);vector<ll>ret(sz(a)+sz(b)-1);REP(i,sz(ret)){ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;}return ret;}const ld EPS=1e-8;//*using mint=modint998244353;const ll mod=998244353;//*//*using mint=modint1000000007;const ll mod=1000000007;//*///using mint=modint;//*typedef vector<mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;typedef vector<vvvm> vvvvm;ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}//*/int main(){ll N;cin>>N;vi A(N);cin>>A;REP(i,N)if(A[i]==0){cout<<0<<endl;cout<<i+1<<" "<<N<<endl;REP(j,N-2)cout<<1<<" "<<N-1-j<<endl;return 0;}auto f=[](ll a,ll b){if(__gcd(a,b)>1||a==0||b==0)return 0LL;return (a-1)*(b-1);};if(N==2){cout<<f(A[0],A[1])<<endl;cout<<1<<" "<<2<<endl;return 0;}if(N==3){ll a=f(f(A[0],A[1]),A[2]);ll b=f(A[0],f(A[1],A[2]));ll c=f(A[1],f(A[0],A[2]));if(a<b&&a<c){cout<<a<<endl;cout<<1<<" "<<2<<endl;cout<<1<<" "<<2<<endl;}else if(b<c){cout<<b<<endl;cout<<2<<" "<<3<<endl;cout<<1<<" "<<2<<endl;}else{cout<<c<<endl;cout<<1<<" "<<3<<endl;cout<<1<<" "<<2<<endl;}return 0;}vi E,O;REP(i,N)(A[i]%2?O:E).emplace_back(i);if(sz(E)>1){cout<<0<<endl;cout<<E[0]+1<<" "<<E[1]+1<<endl;REP(i,N-2)cout<<1<<" "<<N-1-i<<endl;return 0;}if(sz(E)&&sz(O)>1){cout<<0<<endl;cout<<O[0]+1<<" "<<O[1]+1<<endl;ll t=E[0];if(O[1]<t)t--;if(O[0]<t)t--;cout<<t+1<<" "<<N-1<<endl;REP(i,N-3)cout<<1<<" "<<N-2-i<<endl;return 0;}if(sz(O)>3){cout<<0<<endl;cout<<O[2]+1<<" "<<O[3]+1<<endl;cout<<O[0]+1<<" "<<O[1]+1<<endl;cout<<N-3<<" "<<N-2<<endl;REP(i,N-4)cout<<1<<" "<<N-3-i<<endl;return 0;}return 0;}