제출 #633352

#제출 시각아이디문제언어결과실행 시간메모리
633352codr0Dabbeh (INOI20_dabbeh)C++14
0 / 100
1 ms340 KiB
// Code by Parsa Eslami #include <bits/stdc++.h> #define ll long long #define pii pair<int,int> #define pll pair<ll,ll> #define FOR(i,a,b) for(int i=a;i<=b;i++) #define FORR(i,a,b) for(int i=a;i>=b;i--) #define maxm(a,b) a=max(a,b) #define minm(a,b) a=min(a,b) #define bit(i,j) ((j>>i)&1) #define F first #define S second #define dmid int mid=(r+l)/2 #define lc 2*id #define rc 2*id+1 #define err(x) cerr<<#x<<"="<<x<<'\n' #define pb push_back #define SZ(x) (int)x.size() #define all(x) x.begin(),x.end() using namespace std; int rand(int a,int b){ return ((rand()%(b-a+1))+a); } int32_t main(int argc,char* argv[]){ srand(atoi(argv[1])); int n=rand(1,5); int m=rand(1,5); int L=rand(1,5); cout<<n<<" "<<m<<'\n'; FOR(i,1,n){ int x=rand(1,5); FOR(_,1,x) cout<<(char)(rand(0,4)+'a'); cout<<'\n'; } FOR(_,1,L) cout<<(char)(rand(0,4)+'a'); cout<<'\n'; FOR(i,1,m){ int l=rand(0,L-1); int r=rand(l+1,L); cout<<l<<" "<<r<<'\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...