oj.uz

답안 #922289

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922289 2024-02-05T11:13:53 Z AndrijaM 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 458 ms 65688 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn=5e5+10;
int di[4]={1,-1,0,0};
int dj[4]={0,0,-1,1};

int n,m;
bool vis[maxn];
int ma[maxn];
vector<pair<int,int>>g[maxn];
vector<int>path;

void dfs(int node)
{
    while(!g[node].empty())
    {
        auto ax=g[node].back();
        g[node].pop_back();
        if(vis[ax.second])continue;
        vis[ax.second]=1;
        dfs(ax.first);
    }
    path.push_back(node);
    ma[node]++;
    if(ma[node]==2)
    {
            cout<<node+1<< " ";
            path.pop_back();
            while(path.back()!=node)
            {
                cout<<path.back()+1<<" ";
                ma[path.back()]--;
                path.pop_back();
            }
            cout<<endl;
            ma[node]=1;
    }
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin>>n>>m;
    memset(vis,0,sizeof vis);
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        x--;y--;
        g[x].push_back({y,i});
        g[y].push_back({x,i});
    }
    memset(ma,0,sizeof ma);
    dfs(0);
    return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 4 ms 14428 KB Output is correct
4 Correct 6 ms 14684 KB Output is correct
5 Correct 4 ms 14684 KB Output is correct
6 Correct 5 ms 14940 KB Output is correct
7 Correct 8 ms 15708 KB Output is correct
8 Correct 4 ms 14684 KB Output is correct
9 Correct 31 ms 21524 KB Output is correct
10 Correct 6 ms 14796 KB Output is correct
11 Correct 5 ms 14936 KB Output is correct
12 Correct 36 ms 21848 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14424 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 5 ms 14864 KB Output is correct
5 Correct 5 ms 14684 KB Output is correct
6 Correct 5 ms 14936 KB Output is correct
7 Correct 8 ms 15708 KB Output is correct
8 Correct 4 ms 14684 KB Output is correct
9 Correct 32 ms 21588 KB Output is correct
10 Correct 6 ms 14680 KB Output is correct
11 Correct 5 ms 14684 KB Output is correct
12 Correct 37 ms 21836 KB Output is correct
13 Correct 38 ms 23328 KB Output is correct
14 Correct 64 ms 20684 KB Output is correct
15 Correct 89 ms 22216 KB Output is correct
16 Correct 50 ms 23632 KB Output is correct
17 Correct 71 ms 18372 KB Output is correct
18 Correct 65 ms 21840 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 5 ms 14684 KB Output is correct
5 Correct 4 ms 14684 KB Output is correct
6 Correct 5 ms 14936 KB Output is correct
7 Correct 8 ms 15708 KB Output is correct
8 Correct 5 ms 14680 KB Output is correct
9 Correct 32 ms 21588 KB Output is correct
10 Correct 5 ms 14936 KB Output is correct
11 Correct 5 ms 14684 KB Output is correct
12 Correct 37 ms 21932 KB Output is correct
13 Correct 38 ms 23496 KB Output is correct
14 Correct 66 ms 20684 KB Output is correct
15 Correct 71 ms 22236 KB Output is correct
16 Correct 38 ms 23508 KB Output is correct
17 Correct 71 ms 18336 KB Output is correct
18 Correct 65 ms 21636 KB Output is correct
19 Correct 324 ms 59180 KB Output is correct
20 Correct 397 ms 45248 KB Output is correct
21 Correct 443 ms 55584 KB Output is correct
22 Correct 304 ms 65688 KB Output is correct
23 Correct 143 ms 52468 KB Output is correct
24 Correct 458 ms 40020 KB Output is correct
25 Correct 421 ms 57036 KB Output is correct