QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#130494	#1946. Investigating Imposters	karuna^#	AC ✓	59ms	4640kb	C++17	872b	2023-07-24 12:40:30	2023-07-24 12:40:32

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-07-24 12:40:32]
评测

测评结果：AC
用时：59ms
内存：4640kb

查看

[2023-07-24 12:40:30]
提交

answer

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 505;
int n, k, g[MAXN][MAXN];
int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            if (i != j) g[i][j] = 1e9;
    }
    for (int i = 1; i <= n; i++) {
        int sz; cin >> sz;
        while (sz--) {
            int x; cin >> x;
            g[x][i] = 1;
        }
    }
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
    
    for (int i = 1; i <= n; i++) {
        int cnt = 0;
        for (int j = 1; j <= n; j++)
            if (g[i][j] != 1e9) ++cnt;
        
        if (cnt <= k) cout << 0 << '\n';
        else cout << 1 << '\n';
    }
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3428kb

input:

output:

result:

ok 4 lines

Test #2:

score: 0

Accepted

time: 58ms

memory: 4492kb

input:

output:

result:

ok 500 lines

Test #3:

score: 0

Accepted

time: 54ms

memory: 4640kb

input:

500 200
0
4 364 313 255 54
4 1 146 310 340
3 367 139 409
4 412 370 486 452
3 453 281 111
0
3 164 129 431
3 398 177 330
3 267 246 207
1 278
4 249 60 409 241
0
0
0
4 200 198 187 111
2 60 490
2 318 17
0
1 467
0
2 386 14
0
2 357 22
4 245 285 11 324
4 76 380 492 391
0
0
4 397 414 445 91
1 419
0
1 476
4 9...

output:

result:

ok 500 lines

Test #4:

score: 0

Accepted

time: 59ms

memory: 4380kb

input:

500 200
1 461
4 116 3 128 166
4 103 402 470 184
2 223 86
4 168 52 21 436
1 376
3 256 50 328
0
2 132 369
1 189
3 25 98 487
4 30 299 322 281
3 313 434 487
1 198
3 44 37 84
2 305 77
2 226 448
1 43
2 486 276
4 272 441 335 201
4 222 54 177 442
0
4 218 452 441 177
4 477 474 382 86
1 131
1 359
0
2 145 333
...

output:

result:

ok 500 lines

Test #5:

score: 0

Accepted

time: 58ms

memory: 4476kb

input:

499 128
3 183 379 301
3 155 257 61
5 62 450 120 86 250
4 438 130 221 427
1 351
3 248 397 65
5 17 327 222 404 278
2 339 27
3 391 325 422
3 425 233 66
1 57
4 316 42 166 250
3 404 281 146
3 24 286 483
0
5 227 106 145 239 490
1 415
0
2 444 352
1 365
0
5 116 232 304 347 428
1 147
2 465 155
4 9 79 251 114...

output:

result:

ok 499 lines

Test #6:

score: 0

Accepted

time: 58ms

memory: 4420kb

input:

500 2
1 320
2 155 305
3 240 358 178
0
2 241 127
2 125 157
3 313 4 172
2 299 54
1 102
1 307
2 115 310
2 244 124
0
0
3 465 438 53
1 430
3 113 74 55
1 160
1 7
2 44 58
0
3 252 401 71
1 230
0
0
1 159
0
3 370 95 488
1 235
2 230 390
3 154 234 353
0
0
0
1 351
2 193 292
2 202 382
1 125
1 417
2 51 356
3 214 3...

output:

result:

ok 500 lines

Test #7:

score: 0

Accepted

time: 58ms

memory: 4472kb

input:

output:

result:

ok 500 lines

Test #8:

score: 0

Accepted

time: 4ms

memory: 3856kb

input:

182 153
5 2 85 92 124 148
5 19 58 87 93 151
5 5 69 117 131 133
3 114 131 166
2 142 153
1 65
3 20 89 158
5 9 13 28 108 158
0
5 43 82 110 116 158
2 67 83
3 35 115 170
2 37 50
2 11 135
2 51 66
3 38 44 56
6 58 96 154 161 172 179
4 44 112 149 155
4 48 69 148 166
3 30 95 112
3 54 89 157
4 104 122 131 182
...

output:

result:

ok 182 lines