結果
問題 | No.2962 Sum Bomb Bomber |
ユーザー | AD010 |
提出日時 | 2024-11-16 16:20:54 |
言語 | C++17(clang) (17.0.6 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,658 bytes |
コンパイル時間 | 7,497 ms |
コンパイル使用メモリ | 152,252 KB |
実行使用メモリ | 25,964 KB |
平均クエリ数 | 601.00 |
最終ジャッジ日時 | 2024-11-16 16:21:20 |
合計ジャッジ時間 | 18,543 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
ソースコード
#include <iostream> // cout, endl, cin #include <string> // string, to_string, stoi #include <vector> // vector #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound #include <utility> // pair, make_pair #include <tuple> // tuple, make_tuple #include <cstdint> // int64_t, int*_t #include <cstdio> // printf #include <map> // map #include <queue> // queue, priority_queue #include <set> // set #include <stack> // stack #include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset #include <cctype> // isupper, islower, isdigit, toupper, tolower #include <math.h> #include <cmath> #include <climits> #include <functional> #include <iomanip> #include <limits> #include <cassert> #include <random> #include <complex> #include <numeric> #include <regex> #include <list> #include <ctime> #include <chrono> #include <array> #include <cstring> using namespace std; #define ll long long #define ull unsigned long long #define ld long double typedef vector<long long> vll; using LL = long long; using ULL = unsigned long long; using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>; using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>; using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>; using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>; using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>; using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>; using MII = map<int,int>; using MLL = map<LL,LL>; using SI = set<int>; using SL = set<LL>; using MSI = multiset<int>; using MSL = multiset<LL>; template<class T> using MAXPQ = priority_queue<T>; template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >; const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; #define PI 3.14159265358979323846 #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EACH(e, v) for(auto &e : v) #define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it) #define ALL(v) v.begin(),v.end() vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1}; int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1}; /* memo -uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy -isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要) nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10 -dijkstra,Floyd,bellmanford,sccd,topological,treediamiter -compress1,compress2,rotate90 -co,ci,fo1,fo2,fo3,fo4 -bitsearch,binaryserach -bfs(vis.assign忘れるな) -SegTreedec,SegTreeLazydec */ ll ask(ll x, ll y){ cout << "1 " << x << " " << y << endl; ll d; cin >> d; //d = abs(x-1)+abs(y-0); //if(!y) cout << d << endl; return d; } int main(){ cin.tie(0); ios_base::sync_with_stdio(0); ll N; cin >> N; double low=-1e9,high=1e9,ansx,res=INF; int cnt = 150; while(cnt--){ double c1 = (low*2+high)/3; double c2 = (low+high*2)/3; //cout << cnt << endl; double res1 = ask(c1,0); double res2 = ask(c2,0); if(res1 > res2){ low = c1; } else{ high = c2; } } ansx = high; res = INF; low=-1e9,high=1e9; cnt = 150; while(cnt--){ double c1 = (low*2+high)/3; double c2 = (low+high*2)/3; //cout << cnt << endl; if(ask(0,c1) > ask(0,c2)) low = c1; else high = c2; } ll ansy = high; cout << "2 " << ansx << " " << ansy << endl; }