제출 #1102334

#제출 시각아이디문제언어결과실행 시간메모리
1102334modwweA + B (IOI24_aplusb)C++17
100 / 100
1 ms340 KiB
#pragma GCC optimize("Ofast,unroll-loops") #include<bits/stdc++.h> #define int2 long long //#define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".ans","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; #define getchar_unlocked getchar inline int scan() { char c = getchar_unlocked(); int x = 0; while(c<'0'||c>'9') { c=getchar_unlocked(); } while(c>='0'&&c<='9') { x=(x<<1)+(x<<3)+c-'0'; c=getchar_unlocked(); } return x; } void phongbeo(); const int inf=1e9; const int mod2=1e9+9; const int mod1=998244353; struct icd { long double a; int b; }; struct ib { int a; int b; }; struct ic { int a,b,c; }; struct id { int a,b,c,d; }; struct ie { int a,b,c,d,e; }; int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center; int i,s10,s12; int kk; int el=29; int sum(int A,int B) { return A+B; } /* main() { freopen("test.inp","r",stdin); freopen("test.ans","w",stdout); cin>>n; vector<int>a1,a2,a3,a4,a5,a6; for(int i=1; i<=n; i++) cin>>l,a1.pb(l); for(int i=1; i<=n; i++) cin>>l,a2.pb(l); cin>>m; for(int i=1; i<=m; i++) { cin>>l>>r>>l2>>r2; a3.pb(l); a5.pb(r); a4.pb(l2); a6.pb(r2); } vector<int2> vv=mosaic(a1,a2,a3,a4,a5,a6); for(auto x:vv) cout<<x,down }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...