oj.uz

답안 #922285

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922285 2024-02-05T11:09:46 Z AndrijaM 어르신 집배원 (BOI14_postmen) C++14
55 / 100
 500 ms 61396 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];
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);
}

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});
    }
    dfs(0);
    int ma[n];
    memset(ma,0,sizeof ma);
    vector<int>a;
    for(auto ax:path)
    {
        a.push_back(ax);
        ma[ax]++;
        if(ma[ax]==2)
        {
            cout<<ax+1<< " ";
            a.pop_back();
            while(a.back()!=ax)
            {
                cout<<a.back()+1<<" ";
                ma[a.back()]--;
                a.pop_back();
            }
            cout<<endl;
            ma[ax]=1;
        }
    }
    return 0;
}

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12448 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 4 ms 12688 KB Output is correct
4 Correct 6 ms 12700 KB Output is correct
5 Correct 4 ms 12636 KB Output is correct
6 Correct 5 ms 12892 KB Output is correct
7 Correct 11 ms 13916 KB Output is correct
8 Correct 5 ms 12636 KB Output is correct
9 Correct 39 ms 20048 KB Output is correct
10 Correct 7 ms 12636 KB Output is correct
11 Correct 6 ms 12892 KB Output is correct
12 Correct 36 ms 20436 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12636 KB Output is correct
2 Correct 3 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 6 ms 12892 KB Output is correct
5 Correct 5 ms 12636 KB Output is correct
6 Correct 5 ms 12960 KB Output is correct
7 Correct 11 ms 13916 KB Output is correct
8 Correct 4 ms 12636 KB Output is correct
9 Correct 34 ms 20148 KB Output is correct
10 Correct 6 ms 12760 KB Output is correct
11 Correct 6 ms 12892 KB Output is correct
12 Correct 39 ms 20428 KB Output is correct
13 Correct 46 ms 22008 KB Output is correct
14 Correct 84 ms 19116 KB Output is correct
15 Correct 73 ms 21376 KB Output is correct
16 Correct 42 ms 21836 KB Output is correct
17 Correct 84 ms 16792 KB Output is correct
18 Correct 74 ms 20440 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12636 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 4 ms 12636 KB Output is correct
4 Correct 5 ms 12888 KB Output is correct
5 Correct 4 ms 12636 KB Output is correct
6 Correct 5 ms 12892 KB Output is correct
7 Correct 11 ms 13916 KB Output is correct
8 Correct 4 ms 12636 KB Output is correct
9 Correct 31 ms 20180 KB Output is correct
10 Correct 5 ms 12632 KB Output is correct
11 Correct 5 ms 12892 KB Output is correct
12 Correct 37 ms 20416 KB Output is correct
13 Correct 61 ms 21900 KB Output is correct
14 Correct 75 ms 19148 KB Output is correct
15 Correct 80 ms 21188 KB Output is correct
16 Correct 40 ms 21840 KB Output is correct
17 Correct 79 ms 16964 KB Output is correct
18 Correct 74 ms 20276 KB Output is correct
19 Correct 362 ms 59460 KB Output is correct
20 Correct 435 ms 52688 KB Output is correct
21 Execution timed out 520 ms 61396 KB Time limit exceeded
22 Halted 0 ms 0 KB -