제출 #1073277

#제출 시각아이디문제언어결과실행 시간메모리
1073277vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++11
0 / 100
309 ms38008 KiB
#include <bits/stdc++.h> using namespace std; #define STALIN ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define str string #define pb push_back #define pf push_front #define nl "\n" #define ll long long // #define int long long #define all(v) (v).begin() , (v).end() #define rall(v) (v).rbegin(), (v).rend() #define ff first #define ss second #define len(a) a.size() #define pii pair<int,int> const int N = 1e5 + 6; const ll md = 998244353; const ll mod = 1e9 + 7; const ll mega = 1e6 + 3; const int inf = 1e9; void CCCP() { int n , m; cin >> n >> m; int a[n + 1]; for(int i = 1; i <= n; ++i)cin >> a[i]; while(m--){ int l , r , k; cin >> l >> r >> k; cout << 0 << nl; } } signed main() { STALIN; int t = 1; // cin >> t; while (t--) { CCCP(); } #ifndef ONLINE_JUDGE cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif 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...