結果
問題 | No.2819 Binary Binary-Operator |
ユーザー | graph11463 |
提出日時 | 2024-08-15 17:51:29 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 21 ms / 2,000 ms |
コード長 | 3,141 bytes |
コンパイル時間 | 4,532 ms |
コンパイル使用メモリ | 310,912 KB |
実行使用メモリ | 25,812 KB |
平均クエリ数 | 3.00 |
最終ジャッジ日時 | 2024-08-15 17:51:38 |
合計ジャッジ時間 | 9,203 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 21 ms
25,196 KB |
testcase_01 | AC | 18 ms
24,812 KB |
testcase_02 | AC | 18 ms
24,812 KB |
testcase_03 | AC | 18 ms
24,812 KB |
testcase_04 | AC | 17 ms
24,556 KB |
testcase_05 | AC | 18 ms
24,800 KB |
testcase_06 | AC | 17 ms
24,812 KB |
testcase_07 | AC | 18 ms
25,196 KB |
testcase_08 | AC | 17 ms
25,452 KB |
testcase_09 | AC | 18 ms
24,812 KB |
testcase_10 | AC | 17 ms
24,812 KB |
testcase_11 | AC | 17 ms
24,940 KB |
testcase_12 | AC | 20 ms
24,812 KB |
testcase_13 | AC | 18 ms
25,196 KB |
testcase_14 | AC | 17 ms
25,196 KB |
testcase_15 | AC | 18 ms
24,556 KB |
testcase_16 | AC | 18 ms
24,812 KB |
testcase_17 | AC | 19 ms
25,196 KB |
testcase_18 | AC | 18 ms
25,440 KB |
testcase_19 | AC | 18 ms
24,812 KB |
testcase_20 | AC | 17 ms
25,196 KB |
testcase_21 | AC | 17 ms
24,556 KB |
testcase_22 | AC | 18 ms
25,196 KB |
testcase_23 | AC | 18 ms
24,556 KB |
testcase_24 | AC | 18 ms
24,812 KB |
testcase_25 | AC | 18 ms
25,324 KB |
testcase_26 | AC | 18 ms
24,940 KB |
testcase_27 | AC | 18 ms
25,196 KB |
testcase_28 | AC | 18 ms
24,940 KB |
testcase_29 | AC | 18 ms
25,452 KB |
testcase_30 | AC | 18 ms
24,812 KB |
testcase_31 | AC | 18 ms
24,940 KB |
testcase_32 | AC | 19 ms
24,940 KB |
testcase_33 | AC | 19 ms
25,276 KB |
testcase_34 | AC | 19 ms
25,452 KB |
testcase_35 | AC | 18 ms
25,196 KB |
testcase_36 | AC | 18 ms
25,196 KB |
testcase_37 | AC | 17 ms
24,556 KB |
testcase_38 | AC | 18 ms
24,940 KB |
testcase_39 | AC | 18 ms
24,812 KB |
testcase_40 | AC | 19 ms
24,556 KB |
testcase_41 | AC | 18 ms
25,196 KB |
testcase_42 | AC | 18 ms
24,812 KB |
testcase_43 | AC | 18 ms
25,196 KB |
testcase_44 | AC | 18 ms
24,556 KB |
testcase_45 | AC | 17 ms
24,812 KB |
testcase_46 | AC | 18 ms
24,556 KB |
testcase_47 | AC | 18 ms
24,940 KB |
testcase_48 | AC | 17 ms
25,452 KB |
testcase_49 | AC | 18 ms
24,556 KB |
testcase_50 | AC | 18 ms
24,556 KB |
testcase_51 | AC | 18 ms
24,812 KB |
testcase_52 | AC | 18 ms
24,556 KB |
testcase_53 | AC | 18 ms
24,556 KB |
testcase_54 | AC | 19 ms
25,196 KB |
testcase_55 | AC | 19 ms
25,168 KB |
testcase_56 | AC | 18 ms
25,196 KB |
testcase_57 | AC | 17 ms
25,196 KB |
testcase_58 | AC | 18 ms
24,812 KB |
testcase_59 | AC | 18 ms
24,812 KB |
testcase_60 | AC | 18 ms
24,812 KB |
testcase_61 | AC | 18 ms
24,556 KB |
testcase_62 | AC | 17 ms
25,812 KB |
testcase_63 | AC | 17 ms
24,812 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; //ループ系マクロ #define REP(i, n) for (ll i = 0; i < (ll)(n); i++) #define REP2(i, s, n) for (ll i = s; i < (ll)n; i++) #define REP3(v, A) for(auto v: A) #define REP4(It, A) for (auto It=A.begin();It!=A.end();++It) #define REP5(i, n) for (ll i = 0; i * i < (ll)(n); i++) //vector系マクロ #define ALL(A) A.begin(), A.end() #define RVCE(A) reverse(ALL(A)) #define RALL(A) A.rbegin(), A.rend() #define SORT(A) sort(ALL(A)) #define RSORT(A) sort(RALL(A)) //入力系マクロ #define GET(A) cin >> A #define GETV(i,n,A) REP(i,n)cin >> A[i] #define GETV2(i,A) REP(i,A.size())cin >> A[i] //出力系マクロ #define print(A) cout << A << endl #define YeNo(bo) print(((bo) ? "Yes":"No")) #define YENO(bo) print(((bo) ? "YES":"NO")) #define yeno(bo) print(((bo) ? "yes":"no")) #define LISTOUT(A) REP(i,A.SZ())cout << A[i] << " ";cout << endl //雑処理系マクロ #define PB push_back #define IS insert #define SZ size #define TE true #define FE false #define Fir first #define Sec second //定数系マクロ #define I_MAX 2147483647 #define I_MIN -2147483647 #define UI_MAX 4294967295 #define LL_MAX 9223372036854775807 #define LL_MIN -9223372036854775808 #define ULL_MAX 18446744073709551615 //型宣言系マクロ using ll = long long; using ull =unsigned long long; using P = pair<long, int>; using vll = vector<ll>; using vvll = vector<vll>; using vc = vector<char>; //using mint = modint998244353; //デバッグ系マクロ #ifdef _DEBUG #define debug(x) cerr << "dbg: "<< #x << ": " << x << endl #define debug_v(x) cerr << "dbg_vec: " << #x << ": "; REP3(v,x) cerr << v << " "; cerr << endl #define debug_s(x) cerr << "dbg_set: " << #x << ": {"; REP3(v,x) cerr << v << ","; cerr << "}" << endl #define debug_m(x) cerr << "dbg_map: " << #x << ": "; REP4(Ite1,x)cerr << "key: " << Ite1->first << " : " << Ite1->second << " "; cerr<< endl #else #define debug(x) #define debug_v(x) #define debug_s(x) #define debug_m(x) #endif ll GCD(ll a, ll b) {if (b == 0) return a;else return GCD(b, a % b);} ll LCM(ll a, ll b) {return a * b/GCD(a , b);} template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } bool kaibuncheck(string S){ REP(i,S.SZ()/2)if(S[i]!=S[S.SZ()-i-1])return false; return true; } vector<pair<ll,ll>> primefact(ll N){ vector<pair<ll,ll>> ret; REP5(i,N){ ll cot=0; if(N%i==0){ while(N%i==0){ cot++; N/=i; } ret.PB({i,cot}); } } if(N!=1)ret.PB({N,1}); return ret; } struct Node{ int val, par; vector<int> vec; Node(int v, int p){val = v, par = p;}; }; vector<unsigned> read_vector() { unsigned k; cin >> k; vector<unsigned> ret(k); for (auto &&r : ret) cin >> r; return ret; } int main() { ios::sync_with_stdio(0); cin.tie(0); ll X,Y;cin >> X >> Y; cout << 4 << endl; cout << X << ' ' << Y << ' ' << Y << ' ' << Y << endl; ll ret;cin >> ret; cout << ret << endl; }