# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61179 | gs14004 | Abduction 2 (JOI17_abduction2) | C++17 | 1012 ms | 4716 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 pair<int, int> pi;
const int mod = 1e9 + 7;
struct line{
int pos, val, axis;
bool operator<(const line &l)const{
return val < l.val;
}
}a[100005];
int n, m, q;
int st[100005], ed[100005];
lint ldp[100005], rdp[100005];
int rev[2][50005];
lint solve(int x, int y, int cs){
memset(ldp, 0, sizeof(ldp));
memset(rdp, 0, sizeof(rdp));
int xl = 0, xh = n-1, yl = 0, yh = m-1;
set<int> s[2];
lint ret = 0;
for(int i=0; i<n+m; i++){
set<int> ::iterator l, r;
if(a[i].axis == 0){
st[i] = yl, ed[i] = yh;
if(rev[1][ed[i]] < i){
int r = rev[1][ed[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |