# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45235 | gs14004 | Golf (JOI17_golf) | C++17 | 3856 ms | 1048580 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>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int MAXN = 200005;
const int pool = 10000000;
int n, sx, sy, V;
pi s, e;
struct rect{ int sx, ex, sy, ey; }a[100005];
struct seg { int x, s, e, idx; };
vector<seg> segx, segy;
vector<int> gph0[pool];
vector<int> gph1[pool];
int dis[pool];
bool vis[pool];
vector<pi> addE[MAXN];
int val[MAXN];
void solve(vector<seg> l, vector<seg> r){
memset(val, -1, sizeof(val));
for(int i=0; i<MAXN; i++) addE[i].clear();
for(auto &i : l){
addE[i.s].push_back(pi(i.x, i.idx));
addE[i.e + 1].push_back(pi(i.x, -1));
}
int ptr = 0;
for(int i=0; i<MAXN; i++){
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... |