# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787307 | winter0101 | Two Currencies (JOI23_currencies) | C++14 | 719 ms | 53652 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 all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,f,g) for (int i=f;i<=g;i++)
#define for2(i,f,g) for (int i=f;i>=g;i--)
#define for3(i,f,g,h) for(int i=f;i<=g;i+=h)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=1e5+9;
int n,m,q;
struct edg1{
int u,v,w;
}cp[maxn];
struct edg{
int v,w;
};
vector<edg>a[maxn];
struct checkpoint{
int p;
long long c;
bool operator < (const checkpoint &pp){
return c<pp.c;
# | 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... |