# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587002 | keertan | Robot (JOI21_ho_t4) | C++17 | 785 ms | 82020 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.
// GH SAI KEERTAN
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define rep(Begin,End) for (Begin=0;Begin<(End);Begin++)
#define all(x) x.begin(), x.end()
#define all1(x) x.rbegin(), x.rend()
#define sz(x) (int32_t)(x.size())
const int32_t N = 1e5+4, mod =1e9+7;
const int64_t N1=1e18;
const double eps=1e-6,cmp=1e-3;
void solve(){
int n,m;
cin>>n>>m;
int gh=n;
vector<vector<pair<int,int>>> adj(n+2*m);
map<pair<int,int>,int> mid;
vector<int> sum(n+2*m);
int cur=n;
auto id=[&](int v,int c)->int{
auto it=mid.insert({{v,c},n});
n+=it.second;
return it.first->second;
};
for (int i=1,u,v,c,p;i<=m;i++){
cin>>u>>v>>c>>p;
u--,v--;
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... |