# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963691 | LucaIlie | ICC (CEOI16_icc) | C++17 | 0 ms | 0 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>
#include "icc.h"
using namespace std;
int isEdge[101][101];
pair<int, int> edges[100];
int ind, q;
void setRoad( int u, int v ) {
cerr << "muchia " << u << " " << v << "\n";
if ( (u == edges[ind].first && v == edges[ind].second) || (v == edges[ind].first && u == edges[ind].second) ) {
ind++;
isEdge[edges[ind].first][edges[ind].second] = isEdge[edges[ind].second][edges[ind].first] = true;
return;
}
exit( 0 );
}
int query( int n, int m, int a[], int b[] ) {
q++;
for ( int i = 0; i < n; i++ ) {
for ( int j = 0; j < m; j++ ) {
if ( isEdge[a[i]][b[j]] )
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
for ( int i = 0; i < n - 1; i++ ) {
int u, v;
cin >> u >> v;
edges[i] = { u, v };
}
ind = 0; q = 0;
isEdge[edges[0].first][edges[0].second] = isEdge[edges[0].second][edges[0].first] = true;
run( n );
cerr << "CORRECT\n" << q << "\n";
return 0;
}