제출 #1018364

#제출 시각아이디문제언어결과실행 시간메모리
1018364elotelo966Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
280 ms42068 KiB
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 505
#define lim2 1000005
#define fi first
#define se second

int32_t main(){
	faster
	int n,m;cin>>n>>m;
	int dizi[n+1];
	FOR{
		cin>>dizi[i];
	}
	
	while(m--){
		int l,r,x;cin>>l>>r>>x;
		cout<<0<<'\n';
	}
	return 0;
}
#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...