Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "./testlib.h"
- #include <iostream>
- #include <algorithm>
- #include <set>
- using namespace std;
- typedef long long ll;
- const int N = 256;
- const int C = (int)1e9;
- bool used[N + 10][N + 10];
- int main(int argc, char* argv[]){
- registerValidation(argc, argv);
- int n = inf.readInt(1, N, "n");
- inf.readSpace();
- int m = inf.readInt(0, n * (n - 1), "m");
- inf.readEoln();
- for (int i = 0; i < n; i++)
- {
- inf.readInt(0, C, "c");
- if (i != n - 1)
- inf.readSpace();
- }
- inf.readEoln();
- for (int i = 0; i < m; i++)
- {
- int v = inf.readInt(1, n, "v");
- inf.readSpace();
- int u = inf.readInt(1, n, "u");
- inf.readSpace();
- int w = inf.readInt(0, C, "w");
- if (v == u) quitf(_wa, "No loops");
- if (used[v][u])
- quitf(_wa, "No multiple edges");
- used[v][u] = 1;
- inf.readEoln();
- }
- inf.readEof();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment