# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22815 | 버거킹 송죽SK점 우수고객 (#40) | Logistical Metropolis (KRIII5_LM) | C++14 | 89 ms | 4648 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;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define x first
#define y second
int n, m;
vector<pp> edge[100010];
vector<pair<int,pp>> E;
int par[1010];
int R(int x){ return (par[x]==x)?x:(par[x]=R(par[x])); }
bool unite(int a, int b){
a=R(a); b=R(b);
if(a==b) return 0;
par[a]=b; return 1;
}
int main()
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |