# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092628 | ByeWorld | RMQ (NOI17_rmq) | C++14 | 1 ms | 2652 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>
#pragma GCC optimize("O3")
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 1e5+15;
const int INF = 1e18+10;
const int MOD = 998244353;
const int LOG = 32;
int n, m;
vector <ipii> vec;
vector <int> add[MAXN];
int ret[MAXN], ri[MAXN], done[MAXN];
multiset <int> s;
void print(){
return;
cout << "ret\n";
for(int p=1; p<=n; p++) cout << ret[p] << " \n"[p==n];
}
signed main(){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |