結果

問題 No.513 宝探し2
ユーザー kazuppakazuppa
提出日時 2024-10-05 20:27:48
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 22 ms / 2,000 ms
コード長 5,410 bytes
コンパイル時間 6,676 ms
コンパイル使用メモリ 339,644 KB
実行使用メモリ 25,220 KB
平均クエリ数 3.50
最終ジャッジ日時 2024-10-05 20:27:59
合計ジャッジ時間 7,934 ms
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
24,964 KB
testcase_01 AC 22 ms
25,220 KB
testcase_02 AC 22 ms
24,836 KB
testcase_03 AC 20 ms
25,220 KB
testcase_04 AC 20 ms
24,836 KB
testcase_05 AC 19 ms
25,220 KB
testcase_06 AC 20 ms
25,220 KB
testcase_07 AC 20 ms
24,580 KB
testcase_08 AC 19 ms
24,580 KB
testcase_09 AC 19 ms
24,836 KB
testcase_10 AC 21 ms
24,836 KB
testcase_11 AC 19 ms
25,220 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#include <atcoder/all>
using namespace atcoder;
using mints=modint998244353;
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++)
#define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define moda 998244353LL
#define modb 1000000007LL
#define gyaku 166374059LL
#define dai 2500000000000000000LL
#define sho -dai
#define aoi 1e+18
#define tyu 2500000000
#define giri 1000000000
#define en 3.14159265358979
#define eps 1e-14
//#define endl '\n'
#define yn(x) cout<<(x?"Yes\n":"No\n");
#define YN(x) cout<<(x?"YES\n":"NO\n");
#define ci(x) cin>>x;
#define fi(x) cout<<fixed<<setprecision(x);
using it=long long;
using itn=int;
using un=unsigned long long;
using db=long double;
using st=string;
using ch=char;
using bo=bool;
using P=pair<it,it>;
using ip=pair<int,int>;
using mint=modint;
using minto=modint1000000007;
using vi=vector<it>;
using ivi=vector<int>;
using vd=vector<db>;
using vs=vector<st>;
using vc=vector<ch>;
using vb=vector<bo>;
using vp=vector<P>;
using ivp=vector<ip>;
using vm=vector<mint>;
using vms=vector<mints>;
using vmo=vector<minto>;
using sp=set<P>;
using isp=set<ip>;
using ss=set<st>;
using sc=set<ch>;
using si=set<it>;
using isi=set<int>;
using svi=set<vi>;
using vvi=vector<vi>;
using ivvi=vector<ivi>;
using vvd=vector<vd>;
using vvs=vector<vs>;
using vvb=vector<vb>;
using vvc=vector<vc>;
using vvp=vector<vp>;
using ivvp=vector<ivp>;
using vvm=vector<vm>;
using vvms=vector<vms>;
using vvmo=vector<vmo>;
using vsi=vector<si>;
using ivsi=vector<isi>;
using vsp=vector<sp>;
using ivsp=vector<isp>;
using vvsi=vector<vsi>;
using ivvsi=vector<ivsi>;
using vvsp=vector<vsp>;
using ivvsp=vector<ivsp>;
using vvvi=vector<vvi>;
using ivvvi=vector<ivvi>;
using vvvd=vector<vvd>;
using vvvb=vector<vvb>;
using vvvm=vector<vvm>;
using vvvms=vector<vvms>;
using vvvmo=vector<vvmo>;
using vvvvi=vector<vvvi>;
using ivvvvi=vector<ivvvi>;
const it dx[4]={0,1,0,-1};
const it dy[4]={1,0,-1,0};
template<typename T>
void scan(vector<T> &a){
rep(i,0,a.size()-1)cin>>a[i];
}
template<typename T>
void scan(vector<T> &a,vector<T>&b){
rep(i,0,a.size()-1)cin>>a[i]>>b[i];
}
template<typename T>
void scan(vector<pair<T,T>> &a){
rep(i,0,a.size()-1)cin>>a[i].first>>a[i].second;
}
template<typename T>
void dec(vector<T> &a){
rep(i,0,a.size()-1)a[i]--;
}
it gcda(it a,it b){
if(!a||!b){
return max(a,b);
}
while(a%b&&b%a){
if(a>b)a%=b;
else b%=a;
}
return min(a,b);
}
it lcma(it a,it b){
return a/gcda(a,b)*b;
}
bo su(ch c){return ('0'<=c&&c<='9');}
const int MOD = modb;
vi fact, fact_inv, inv;
/* init_nCk :
:O(n)
*/
void init_nCk(int SIZE){
fact.resize(SIZE+5);
fact_inv.resize(SIZE+5);
inv.resize(SIZE+5);
fact[0]=fact[1]=1;
fact_inv[0]=fact_inv[1]=1;
inv[1]=1;
rep(i,2,SIZE+4){
fact[i]=fact[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
fact_inv[i]=fact_inv[i-1]*inv[i]%MOD;
}
}
/* nCk :MOD( int_nCk )
:O(1)
*/
int nCk(int n, int k){
assert(!(n<k));
assert(!(n<0||k<0));
return fact[n]*(fact_inv[k]*fact_inv[n-k]%MOD)%MOD;
}
struct dsu1{
ivi par,siz;
void init(int n){
rep(i,0,n-1)par.emplace_back(i);
rep(i,0,n-1)siz.emplace_back(1);
}
int leader(int u){
if(par[u]==u)return u;
return par[u]=leader(par[u]);
}
void merge(int u,int v){
int ru=leader(u),rv=leader(v);
if(ru==rv)return;
if(ru>rv)swap(ru,rv);
siz[ru]+=siz[rv];
par[rv]=ru;
}
bool same(int u,int v){
return leader(u)==leader(v);
}
int size(int u){
return siz[leader(u)];
}
};
struct dsu2{
ivvi par,siz;int h,w;
void init(int x,int y){
h=x,w=y;par.resize(h),siz.resize(h);
rep(i,0,h-1)
rep(j,0,w-1)par[i].emplace_back(i*w+j);
rep(i,0,h-1)
rep(j,0,w-1)siz[i].emplace_back(1);
}
int leader(int x,int y){
if(par[x][y]==x*par[0].size()+y)return x*w+y;
return par[x][y]=leader(par[x][y]/w,par[x][y]%w);
}
void merge(int a,int b,int c,int d){
int ru=leader(a,b),rv=leader(c,d);
if(ru==rv)return;
if(size(ru/w,ru%w)<size(rv/w,ru%w))swap(ru,rv);
siz[ru/w][ru%w]+=siz[rv/w][rv%w];
par[rv/w][rv%w]=ru;
}
bool same(int a,int b,int c,int d){
return leader(a,b)==leader(c,d);
}
int size(int a,int b){
int ru=leader(a,b);
return siz[ru/w][ru%w];
}
};
/*
struct nod{
it val;
int siz;
nod(int v=0,int s=0):val(v),siz(s){}
};
nod op(nod a,nod b){return nod(a.val+b.val,a.siz+b.siz);}
nod e(){return nod(0,0);}
struct act{
int a;
act(int e=0):a(e){}
};
nod mapping(act f,nod x){return nod(f.a+x.val,x.siz);}
act comp(act f,act g){return act(f.a+g.a);}
act id(){return act(0);}
*/
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a,b,c;
cout<<"0 0"<<endl;cin>>a;
if(!a)return 0;
cout<<"0 100000"<<endl;cin>>b;
if(!b)return 0;
cout<<"100000 100000"<<endl;cin>>c;
if(!c)return 0;
rep(i,0,100000){
int e=a-i;
if(e<0||100000<e)continue;
if(i+100000-e==b&&200000-i-e==c){
cout<<i<<' '<<e<<endl;
return 0;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0