QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#61061 | #3828. László Babai | NYCU_Yamada# | WA | 2ms | 3340kb | C++23 | 462b | 2022-11-09 19:18:57 | 2022-11-09 19:19:00 |
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;
}
详细
Test #1:
score: 0
Wrong Answer
time: 2ms
memory: 3340kb
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
result:
wrong answer 2nd lines differ - expected: 'yes', found: ''