QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #88846 | #3828. László Babai | SorahISA | AC ✓ | 1ms | 3416kb | C++20 | 459b | 2023-03-17 19:33:28 | 2023-03-17 19:33:30 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
void solve() {
int m1; cin >> m1;
for (int i = 0, u, v; i < m1; ++i) cin >> u >> v;
int m2; cin >> m2;
for (int i = 0, u, v; i < m2; ++i) cin >> u >> v;
cout << (m1 == m2 ? "yes" : "no") << "\n";
}
int32_t main() {
fastIO();
int t = 1; cin >> t;
while (t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3416kb
input:
100 1 2 3 2 1 3 1 2 3 1 2 2 3 1 3 3 1 3 1 2 3 2 1 3 2 0 2 1 2 3 2 3 3 2 1 3 2 1 1 3 2 2 3 1 3 2 0 1 3 2 0 0 1 3 2 2 2 3 3 1 0 1 2 3 2 3 2 1 3 2 3 1 3 2 3 1 3 2 1 2 3 3 3 1 2 3 2 1 3 1 2 3 2 3 1 0 2 1 3 2 3 2 2 1 3 2 0 0 2 3 2 1 3 0 2 1 3 1 2 1 1 3 0 0 2 2 3 1 2 3 2 3 3 1 1 2 1 1 2 0 2 1 2 1 3 2 2 3 ...
output:
no yes no no no no yes no no yes yes no yes yes no no yes no no yes no no no yes no yes yes yes no no no no no no yes no yes yes no yes no yes no no no no yes no no yes no no no no yes no no yes no no no no yes yes no yes no no no no yes yes no yes no no no no yes yes no no no no no no yes no no yes...
result:
ok 100 lines