# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291254 | mohamedsobhi777 | Putovanje (COCI20_putovanje) | C++14 | 158 ms | 26104 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>
/*
#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")*/
#define I inline void
#define S struct
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
using namespace std;
using ll = long long;
using ld = long double;
const ll N = 1e5 + 7, mod = 1e9 + 7;
const ll inf = 1e16 ;
// How lleresting!
int n ;
ll ans ;
vector<pair<int,pair<ll,ll>>> adj[N] ;
int tim ;
int up[N][20] ;
int st[N] , en[N] ;
int cnt[N] ;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |