oj.uz

Submission #930915

# Submission time Handle Problem Language Result Execution time Memory
930915 2024-02-20T19:35:17 Z Denkata Senior Postmen (BOI14_postmen) C++14
100 / 100
 463 ms 76836 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e5+3;
int i,j,p,q,n,m,k;
int used[maxn],uk[maxn],came[maxn],usedge[maxn];
vector <pair <int,int>> v[maxn];
vector <vector <int>> ans;
void dfs(int u)
{
    if(used[u]){
    p = u;
    while(used[p])
    {
        cout<<p<<" ";
        used[p] = 0;
        p = came[p];
    }
    cout<<endl;
    }
    while(uk[u]<v[u].size())
    {
        int q = v[u][uk[u]].second;
        int edge = v[u][uk[u]].first;
        uk[u]++;
        if(!usedge[edge])
        {
            usedge[edge] = true;
            used[u] = 1;
            came[u] = q;
            dfs(q);
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>p>>q;
        v[p].push_back({i,q});
        v[q].push_back({i,p});
    }
    dfs(1);
    return 0;
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:20:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     while(uk[u]<v[u].size())
      |           ~~~~~^~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 5 ms 15196 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 5 ms 15452 KB Output is correct
7 Correct 8 ms 16476 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 31 ms 24144 KB Output is correct
10 Correct 5 ms 15196 KB Output is correct
11 Correct 5 ms 15216 KB Output is correct
12 Correct 37 ms 24660 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 5 ms 15196 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 5 ms 15452 KB Output is correct
7 Correct 8 ms 16472 KB Output is correct
8 Correct 4 ms 15084 KB Output is correct
9 Correct 32 ms 24236 KB Output is correct
10 Correct 5 ms 15196 KB Output is correct
11 Correct 5 ms 15196 KB Output is correct
12 Correct 36 ms 24688 KB Output is correct
13 Correct 37 ms 26708 KB Output is correct
14 Correct 64 ms 23120 KB Output is correct
15 Correct 71 ms 25544 KB Output is correct
16 Correct 38 ms 26912 KB Output is correct
17 Correct 74 ms 20564 KB Output is correct
18 Correct 64 ms 24688 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Correct 5 ms 15192 KB Output is correct
5 Correct 3 ms 14940 KB Output is correct
6 Correct 4 ms 15452 KB Output is correct
7 Correct 11 ms 16476 KB Output is correct
8 Correct 4 ms 15196 KB Output is correct
9 Correct 33 ms 24340 KB Output is correct
10 Correct 5 ms 15192 KB Output is correct
11 Correct 4 ms 15196 KB Output is correct
12 Correct 36 ms 24808 KB Output is correct
13 Correct 39 ms 26708 KB Output is correct
14 Correct 66 ms 23124 KB Output is correct
15 Correct 71 ms 25800 KB Output is correct
16 Correct 46 ms 26716 KB Output is correct
17 Correct 73 ms 20564 KB Output is correct
18 Correct 64 ms 24660 KB Output is correct
19 Correct 297 ms 76836 KB Output is correct
20 Correct 392 ms 58592 KB Output is correct
21 Correct 437 ms 70476 KB Output is correct
22 Correct 344 ms 76796 KB Output is correct
23 Correct 136 ms 60752 KB Output is correct
24 Correct 463 ms 44264 KB Output is correct
25 Correct 448 ms 66124 KB Output is correct