QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#408255 | #6705. Median | _Dusker# | AC ✓ | 2ms | 3760kb | C++20 | 1.0kb | 2024-05-09 22:02:16 | 2024-05-09 22:02:17 |
Judging History
answer
#include <bits/stdc++.h>
#define ioclear std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout.tie(nullptr);
#define endl '\n'
constexpr int mmax = 110;
void solve()
{
int n, m;
std::cin >> n >> m;
std::vector<std::bitset<mmax>> g(n + 1);
for(int i = 1; i <= m; i++)
{
int u, v;
std::cin >> u >> v;
g[u][v] = 1;
}
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(g[j][i])
g[j] |= g[i];
std::string ans(n, '0');
bool flag = true;
for(int i = 1; i <= n; i++)
if(g[i][i])
{
flag = false;
break;
}
if(!flag)
{
std::cout << ans << endl;
return;
}
std::vector<int> pre(n + 1), suf(n + 1);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(g[i][j])
pre[i]++, suf[j]++;
for(int i = 1; i <= n; i++)
if(pre[i] <= n / 2 && suf[i] <= n / 2)
ans[i - 1] = '1';
std::cout << ans << endl;
}
signed main()
{
#ifdef ONLINE_JUDGE
ioclear;
#endif
int t;
std::cin >> t;
while(t--)
solve();
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3760kb
input:
2 5 4 1 2 3 2 2 4 2 5 3 2 1 1 2 3
output:
01000 000
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 3680kb
input:
66 13 2 9 13 7 11 11 19 9 1 8 1 5 1 2 8 4 2 2 1 5 2 6 3 3 11 3 2 4 6 6 10 9 8 3 5 1 7 5 8 3 9 4 9 6 7 3 1 2 3 11 6 9 4 1 6 5 2 1 5 4 6 8 4 15 15 10 6 15 8 7 6 11 1 5 2 3 4 11 13 4 6 10 12 10 13 1 6 15 2 5 12 13 14 5 3 15 86 14 12 8 1 14 9 8 15 5 10 1 9 11 2 6 2 7 10 10 13 14 5 4 13 5 8 4 10 13 9 6 9...
output:
1111111111111 01001000111 111 11111111111 111111111111111 001001000000000 00100 01100 1111111 1000000000000 111101101 111111111 000011111011101 010111111 001100000 0100001001101 1111111111111 001000010000000 10010111011 001000000000100 11111111111 00100000011 11111 01000000110 11101110111 00000 1111...
result:
ok 66 lines