# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423827 | tqbfjotld | Treatment Project (JOI20_treatment) | C++14 | 319 ms | 185924 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 int long long
int T[5005];
int L[5005];
int R[5005];
int C[5005];
vector<int> adjl[5005];
int dist[5005];
main(){
int n,m;
scanf("%lld%lld",&n,&m);
for (int x = 0; x<m; x++){
scanf("%lld%lld%lld%lld",&T[x],&L[x],&R[x],&C[x]);
}
for (int x = 0; x<m; x++){
for (int y = 0; y<m; y++){
if (T[y]>T[x]){
if (L[x]-T[x]-1<=R[y]-T[y]){
adjl[x].push_back(y);
}
}
else{
if (L[x]+T[x]-1<=R[y]+T[y]){
adjl[x].push_back(y);
}
}
}
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... |