| Task: | Polut |
| Sender: | alli |
| Submission time: | 2026-01-17 15:39:00 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| #4 | WRONG ANSWER | 0 |
| #5 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 3, 4, 5 | details |
| #2 | ACCEPTED | 0.01 s | 1, 4, 5 | details |
| #3 | ACCEPTED | 0.24 s | 1, 4, 5 | details |
| #4 | WRONG ANSWER | 0.13 s | 1, 4, 5 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 2, 5 | details |
| #6 | WRONG ANSWER | 0.87 s | 2, 5 | details |
| #7 | RUNTIME ERROR | 0.82 s | 2, 4, 5 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3, 5 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3, 5 | details |
| #10 | RUNTIME ERROR | 0.82 s | 3, 4, 5 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 5 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 5 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 4, 5 | details |
| #16 | ACCEPTED | 0.01 s | 1, 4, 5 | details |
Code
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int n, m, p;
vector<int> v[101010];
int z[101010];
int l = 0;
void lyhyin(){
queue<pair<int,int>> q;
q.push({1,0});
int a = 0;
int r = 0;
while (!q.empty()){
int x = q.front().first, c = q.front().second; q.pop();
if (x == n){
r = c;
break;
}
for (int i : v[x]){
if (i == n) a++;
if (z[i])continue;
z[i] = 1;
q.push({i,c+1});
}
}
cout << r << " ";
memset(z,0,sizeof(z));
for (int j = 1; j < p; j++){
a = 0;
while (!q.empty()) q.pop();
q.push({1,0});
while (!q.empty()){
int x = q.front().first, c = q.front().second; q.pop();
//cout << "x " << x << " " << c << "\n";
z[x] = 0;
if (x == n && c == r+j){
break;
}
for (int i : v[x]){
//cout << "i c+1 " << i << " " << c+1 << "\n";
if (i == n && c+1 == r+j) a++;
//if (z[i]) continue;
z[i] = 1;
q.push({i,c+1});
}
}
cout << a << " ";
}
}
int main(){
cin >> n >> m >> p;
for (int i = 1; i <= m; i++){
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
lyhyin();
}Test details
Test 1 (public)
Group: 1, 3, 4, 5
Verdict: ACCEPTED
| input |
|---|
| 4 5 3 1 2 1 3 2 3 2 4 ... |
| correct output |
|---|
| 2 2 10 |
| user output |
|---|
| 2 2 10 |
Test 2
Group: 1, 4, 5
Verdict: ACCEPTED
| input |
|---|
| 2 1 1 2 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 3
Group: 1, 4, 5
Verdict: ACCEPTED
| input |
|---|
| 10 20 10 6 10 8 1 4 6 9 1 ... |
| correct output |
|---|
| 2 5 34 123 611 2503 11415 4882... |
| user output |
|---|
| 2 5 34 123 611 2503 11415 4882... |
Test 4
Group: 1, 4, 5
Verdict: WRONG ANSWER
| input |
|---|
| 10 20 10 4 10 2 3 8 4 7 8 ... |
| correct output |
|---|
| 1 7 26 140 509 2483 9454 43570... |
| user output |
|---|
| 2 7 26 140 509 2483 9454 43570... |
Feedback: Incorrect character on line 1 col 1: expected "1", got "2"
Test 5
Group: 2, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 2 96303 53915 64836 4748 6389 40954 60420 91374 ... |
| correct output |
|---|
| 1 0 |
| user output |
|---|
| (empty) |
Test 6
Group: 2, 5
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 2 72817 17293 93269 856 51497 26888 41679 96276 ... |
| correct output |
|---|
| 5 8 |
| user output |
|---|
| 10 8 |
Feedback: Incorrect character on line 1 col 1: expected "5", got "10"
Test 7
Group: 2, 4, 5
Verdict: RUNTIME ERROR
| input |
|---|
| 474 517 2 1 2 1 3 2 4 3 4 ... |
| correct output |
|---|
| 0 0 |
| user output |
|---|
| (empty) |
Test 8
Group: 3, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 3 59846 53439 11468 57874 83443 13914 46177 15147 ... |
| correct output |
|---|
| 1 0 32 |
| user output |
|---|
| (empty) |
Test 9
Group: 3, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 3 23665 7205 83252 56604 14852 7299 2836 9864 ... |
| correct output |
|---|
| 1 0 33 |
| user output |
|---|
| (empty) |
Test 10
Group: 3, 4, 5
Verdict: RUNTIME ERROR
| input |
|---|
| 474 517 3 1 2 1 3 2 4 3 4 ... |
| correct output |
|---|
| 0 0 986681410 |
| user output |
|---|
| (empty) |
Test 11
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 10 691 424 80 318 681 539 33 342 ... |
| correct output |
|---|
| 1 6 39 252 1242 7715 36269 212... |
| user output |
|---|
| (empty) |
Test 12
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 10 979 324 770 562 560 7 169 738 ... |
| correct output |
|---|
| 2 2 81 150 2435 6460 66843 223... |
| user output |
|---|
| (empty) |
Test 13
Group: 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 10 54544 86042 14060 20746 47891 4317 76648 84193 ... |
| correct output |
|---|
| 1 3 54 169 1917 6237 56922 192... |
| user output |
|---|
| (empty) |
Test 14
Group: 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 10 73275 88704 74521 54506 51906 57193 29561 44568 ... |
| correct output |
|---|
| 6 19 338 1212 12462 49357 3873... |
| user output |
|---|
| (empty) |
Test 15
Group: 4, 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 1989 10 822 821 979 989 138 139 968 981 ... |
| correct output |
|---|
| 1 44 2935 131120 6357888 28564... |
| user output |
|---|
| (empty) |
Test 16
Group: 1, 4, 5
Verdict: ACCEPTED
| input |
|---|
| 3 3 1 1 2 1 3 2 3 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |