# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484382 | Mahdi | Examination (JOI19_examination) | C++17 | 143 ms | 6624 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 ("Ofast")
using namespace std;
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
typedef long long ll;
const int N=1e5+5;
int n, q, s[N], t[N], a[N], aa[N], b[N], bb[N], c[N], cc[N], ans[N];
vector<pair<pii, pii>>v;
vector<pair<pii, int>>w;
bool cmp(const int &x, const int &y){
return s[x]+t[x]<s[y]+t[y];
}
bool cpp(const int &x, const int &y){
return s[x]<s[y];
}
bool ppp(const int &x, const int &y){
return t[x]<t[y];
}
struct fenwick{
vector<int>bit=vector<int>(n, 0);
void add(int i){
for(int j=i;j<n;j|=(j+1))
++bit[j];
# | 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... |