# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757252 | Doncho_Bonboncho | RMQ (NOI17_rmq) | C++14 | 88 ms | 35276 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MAX_N = 1e6;
const int INF = 1e9;
const int mod = 1e9 + 7;
#ifndef LOCAL
#define cerr if(false) cerr
#endif
std::vector<std::pair<int, int>> Q[MAX_N];
std::set<int> pos;
std::set<int> nums;
bool use[MAX_N];
int nas[MAX_N];
int main () {
#ifndef LOCAL
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
#endif
int n, q;
std::cin>>n>>q;
for( int i=0 ; i<q ; i++ ){
int a, b, c;
std::cin>>a>>b>>c;
Q[c].push_back({a, b});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |