Submission #337599

#TimeUsernameProblemLanguageResultExecution timeMemory
337599Edbert2397Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
0 / 100
250 ms2028 KiB
# include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define fi first #define se second typedef long long ll; #define pii pair<int,int> const int N = 2e5 + 5; const int INF = 1e9; const ll mod = 1e9+7; int n,m,arr[N],l,r,k; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen(,r,stdin); //freopen(,w,stdout); cin>>n>>m; for(int i = 1;i<=n;i++){ cin>>arr[i]; } for(int i = 1;i<=m;i++){ cin>>l>>r>>k; cout<<0<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...