# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5428 | tncks0121 | 특수한 그래프 (IZhO13_specialg) | C++98 | 48 ms | 1080 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 <stdio.h>
#include <assert.h>
int main() {
int n; scanf("%d", &n);
while(n--) scanf("%*d");
int q; scanf("%d", &q);
while(q--) {
int t; scanf("%d", &t);
if(t == 1) {
scanf("%*d");
}else {
int a, b; scanf("%d%d", &a, &b);
assert(a != b);
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |