# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846310 | vjudge1 | KOVANICE (COI15_kovanice) | C++17 | 677 ms | 40368 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
#define tol(bi) (1LL<<((int)(bi)))
int32_t main(){
int m,n,v;
cin>>m>>n>>v;
vector<int> par(n);
iota(par.begin(), par.end(), 0);
function<int(int)> fp;fp = [&](int node){
if (par[node]==node) return node;
return par[node]=fp(par[node]);
};
vector<array<int,2>> seq;
for (int i = 0; i < v; i++){
string str;
cin>>str;
int a=0, b=0;
char chr;
int hehe = 1;
while (str.size() && str.back()!='<' && str.back()!='>' && str.back()!='='){
b+=(str.back()-'0')*hehe;
hehe*=10;
str.pop_back();
}
chr=str.back();
str.pop_back();
hehe=1;
while (str.size()){
a+=(str.back()-'0')*hehe;
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... |