# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94541 | szawinis | Segments (IZhO18_segments) | C++17 | 2542 ms | 14160 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.
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
using namespace std;
#define long long long
const long MOD = 1e9+7, LINF = 1e18 + 1e16;
const int INF = 1e9+1;
const double EPS = 1e-10;
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const int N = 2e5+1, MAGIC = 3000, S = 3000;
class TaskD {
int n, T, id[N], last[N], blk[N];
bool valid[N];
pair<int,int> segs[N];
vector<pair<int,int> > fl, fr;
// vector<vector<int> > tl, tr;
//
// int get_r(int l, int r, int targ_r) {
// int ret = 0;
// for(l += fr.size(), r += fr.size() + 1; l < r; l >>= 1, r >>= 1) {
// if(l & 1) {
// auto it = lower_bound(tr[l].begin(), tr[l].end(), targ_r);
// ret += it - tr[l].begin();
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |