QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#389555 | #5520. Distance Parities | Giga_Cronos# | WA | 1ms | 3552kb | C++23 | 955b | 2024-04-14 15:26:16 | 2024-04-14 15:26:17 |
Judging History
answer
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<string> vs(n);
for (int i = 0; i < n; i++)
cin >> vs[i];
vector<pii> ans;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (vs[i][j] == '1')
ans.push_back(pii(i + 1, j + 1));
bool ok = 1;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (vs[i][j] == '0') {
bool mok = 0;
for (int k = 0; k < n; k++)
if (vs[i][k] == '1' && vs[k][j] == '1')
mok = 1;
ok = (ok & mok);
}
if (ok) {
cout << "YES\n";
for (auto p : ans)
cout << p.first << ' ' << p.second << "\n";
} else
cout << "NO\n";
}
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3552kb
input:
3 3 011 101 110 4 0100 1000 0001 0010 5 01010 10101 01010 10101 01010
output:
YES 1 2 1 3 2 3 NO YES 1 2 1 4 2 3 2 5 3 4 4 5
result:
wrong answer Integer 1 violates the range [2, 3] (test case 1)