# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523847 | amunduzbaev | Bodyguard (JOI21_bodyguard) | C++17 | 25095 ms | 308992 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;
#define ar array
#define int long long
const int N = 6005;
const int Q = 3e6 + 5;
const int INF = 1e10;
int a[N], t[N], t2[N], b[N], c[N];
int up[N][N], ri[N][N], dp[N][N];
int T[Q], p[Q];
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
vector<int> tx, ty;
auto add = [&](int x, int y){
tx.push_back(x);
ty.push_back(y);
};
int n, q; cin>>n>>q;
vector<int> a(n), b(n), c(n), t(n), t2(n);
for(int i=0;i<n;i++){
cin>>t[i]>>a[i]>>b[i]>>c[i];
t2[i] = t[i] + abs(a[i] - b[i]);
add(t[i] + a[i], t[i] - a[i]);
add(t2[i] + b[i], t2[i] - b[i]);
}
# | 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... |