# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971892 | parlimoos | Examination (JOI19_examination) | C++14 | 1124 ms | 258708 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.
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'
int n , q;
vector<arr(3)> a;
vector<int> seg[3][2400001] , cmp;
vector<arr(4)> ops;
int seginf[2400001][2] , is[600000];
void cmpInt(){
sort(cmp.bg() , cmp.end());
cmp.resize(int(unique(cmp.bg() , cmp.end()) - cmp.bg()));
for(auto &el : a){
el[0] = int(lb(cmp.bg() , cmp.end() , el[0]) - cmp.bg());
el[1] = int(lb(cmp.bg() , cmp.end() , el[1]) - cmp.bg());
el[2] = int(lb(cmp.bg() , cmp.end() , el[2]) - cmp.bg());
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |