結果
問題 | No.1149 色塗りゲーム |
ユーザー | hotman78 |
提出日時 | 2020-08-07 21:47:24 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 108 ms / 2,000 ms |
コード長 | 4,411 bytes |
コンパイル時間 | 6,315 ms |
コンパイル使用メモリ | 403,600 KB |
実行使用メモリ | 24,372 KB |
平均クエリ数 | 19.88 |
最終ジャッジ日時 | 2023-09-24 04:20:07 |
合計ジャッジ時間 | 12,086 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
24,264 KB |
testcase_01 | AC | 38 ms
23,376 KB |
testcase_02 | AC | 39 ms
24,012 KB |
testcase_03 | AC | 39 ms
23,832 KB |
testcase_04 | AC | 39 ms
23,400 KB |
testcase_05 | AC | 38 ms
23,820 KB |
testcase_06 | AC | 39 ms
23,388 KB |
testcase_07 | AC | 38 ms
23,664 KB |
testcase_08 | AC | 39 ms
23,532 KB |
testcase_09 | AC | 39 ms
24,012 KB |
testcase_10 | AC | 41 ms
23,640 KB |
testcase_11 | AC | 40 ms
23,376 KB |
testcase_12 | AC | 40 ms
23,676 KB |
testcase_13 | AC | 41 ms
24,348 KB |
testcase_14 | AC | 42 ms
23,616 KB |
testcase_15 | AC | 41 ms
24,000 KB |
testcase_16 | AC | 42 ms
24,372 KB |
testcase_17 | AC | 42 ms
23,832 KB |
testcase_18 | AC | 42 ms
23,412 KB |
testcase_19 | AC | 43 ms
23,964 KB |
testcase_20 | AC | 42 ms
23,376 KB |
testcase_21 | AC | 41 ms
23,388 KB |
testcase_22 | AC | 42 ms
23,412 KB |
testcase_23 | AC | 44 ms
23,664 KB |
testcase_24 | AC | 44 ms
24,336 KB |
testcase_25 | AC | 45 ms
23,820 KB |
testcase_26 | AC | 44 ms
23,520 KB |
testcase_27 | AC | 44 ms
23,376 KB |
testcase_28 | AC | 45 ms
23,376 KB |
testcase_29 | AC | 46 ms
23,640 KB |
testcase_30 | AC | 83 ms
23,832 KB |
testcase_31 | AC | 79 ms
24,252 KB |
testcase_32 | AC | 82 ms
24,036 KB |
testcase_33 | AC | 83 ms
23,652 KB |
testcase_34 | AC | 89 ms
24,036 KB |
testcase_35 | AC | 82 ms
23,616 KB |
testcase_36 | AC | 89 ms
24,264 KB |
testcase_37 | AC | 88 ms
23,820 KB |
testcase_38 | AC | 88 ms
24,324 KB |
testcase_39 | AC | 91 ms
23,700 KB |
testcase_40 | AC | 92 ms
23,832 KB |
testcase_41 | AC | 89 ms
23,688 KB |
testcase_42 | AC | 94 ms
24,324 KB |
testcase_43 | AC | 91 ms
23,364 KB |
testcase_44 | AC | 102 ms
23,376 KB |
testcase_45 | AC | 97 ms
23,364 KB |
testcase_46 | AC | 96 ms
23,544 KB |
testcase_47 | AC | 99 ms
23,652 KB |
testcase_48 | AC | 100 ms
23,820 KB |
testcase_49 | AC | 108 ms
24,048 KB |
コンパイルメッセージ
main.cpp:53:22: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 53 | inline auto reversed(auto v){reverse(v.begin(),v.end());return v;} | ^~~~ main.cpp:60:12: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 60 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;} | ^~~~ main.cpp:60:26: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 60 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;} | ^~~~ main.cpp:61:12: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 61 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;} | ^~~~ main.cpp:61:26: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’ 61 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;} | ^~~~
ソースコード
#pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC push_options #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx") #include<bits/stdc++.h> #include <xmmintrin.h> #include <immintrin.h> using namespace::std; __attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);} #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/priority_queue.hpp> #include<ext/pb_ds/tag_and_trait.hpp> // #include <boost/multiprecision/cpp_dec_float.hpp> // #include <boost/multiprecision/cpp_int.hpp> // namespace mp = boost::multiprecision; // typedef mp::number<mp::cpp_dec_float<0>> cdouble; // typedef mp::cpp_int cint; template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>; template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>; template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>; typedef long long lint; #define INF (1LL<<60) #define IINF (1<<30) #define LINF (9223372036854775807LL) #define EPS (1e-10) #define endl ('\n') //#define MOD 1000000007LL #define MOD 998244353LL //#define MOD 18446744069414584321ULL typedef vector<lint> vec; typedef vector<vector<lint>> mat; typedef vector<vector<vector<lint>>> mat3; typedef vector<string> svec; typedef vector<vector<string>> smat; template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;} template<typename T>inline void numout2(T t){for(auto i:t)numout(i);} template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;} template<typename T>inline void output2(T t){for(auto i:t)output(i);} template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;} template<typename T>inline void debug2(T t){for(auto i:t)output(i);} template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;} template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);} #define rep(i,...) for(auto i:range(__VA_ARGS__)) #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__))) #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i) #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i) #define irep(i) for(lint i=0;;++i) inline vector<int64_t> range(int64_t n){vector<int64_t>v(n);iota(v.begin(),v.end(),0LL);return v;} inline vector<int64_t> range(int64_t a,int64_t b){vector<int64_t>v(b-a);iota(v.begin(),v.end(),a);return v;} inline vector<int64_t> range(int64_t a,int64_t b,int64_t c){vector<int64_t>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;} inline auto reversed(auto v){reverse(v.begin(),v.end());return v;} #define all(n) begin(n),end(n) #define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2)) //inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;} //inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;} // inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;} // inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;} bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;} bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;} const vector<lint> dx={1,0,-1,0,1,1,-1,-1}; const vector<lint> dy={0,1,0,-1,1,-1,1,-1}; #define SUM(v) accumulate(all(v),0LL) auto call=[](auto f,auto... args){return f(f,args...);}; template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} int main(){ lint n; cin>>n; vec a(n,1); lint m; if(n%2){ cout<<1<<" "<<(n+1)/2<<endl<<flush; m=(n+1)/2; }else{ cout<<2<<" "<<n/2<<endl<<flush; m=n/2+1; } while(1){ lint t,k,x; cin>>t>>k>>x; if(t==0)exit(0); if(t==1)assert(0); if(t==2)assert(0); if(t==3){ if(x>=m){ cout<<k<<" "<<x-m<<endl<<flush; }else{ cout<<k<<" "<<x+m<<endl<<flush; } } } }