oj.uz

Submission #465788

# Submission time Handle Problem Language Result Execution time Memory
465788 2021-08-16T18:51:37 Z AmirElarbi Senior Postmen (BOI14_postmen) C++14
0 / 100
 500 ms 2764 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e7
#define unsigned u
#define eps 1e-18
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MAX_A 100005
#define V 450
#define re register
#define maxi(a,b) ((a) > (b) ? (a) : (b))
using namespace std;
vii adj[100005];
bool vis[100005];
bool tv[100005];
int n,m,used;
bool dfs(int u, int p, int start){
    //cout << u << " " << start << " " << used << endl;
    tv[u] = 1;
    for(auto x : adj[u])
    {
        
        if(x.fi == p)
            continue;
        if(vis[x.se])
            continue;
        if(x.fi == start)
        {
            vis[x.se] = true;
            used++;
            tv[u] = 0;
            return true;
        }
        if(tv[x.fi])
            continue;
        vis[x.se] = true;
        used++;
        if(dfs(x.fi,u,start)){
            cout << x.fi << " ";
            tv[u] = 0;
            return true;
        }
        vis[x.se] = 0;
        used--;
    }
    tv[u] = 0;
    return false;
}
int main(){
    optimise;
    cin >> n >> m;
    for (int i = 0; i < m; ++i)
    {
        int a,b;
        cin >> a >>b;
        adj[a].pb({b,i});
        adj[b].pb({a,i});
    }
    int d = 1;
    while (used != m)
    {
        for (int i = d; i <= n; ++i)
        { 
            if(dfs(i,-1,i)){
                cout << i;
                break;
            }  else 
                d++;
        }
        cout << endl;
    }
}

Subtask #1
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 3 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 5 ms 2764 KB Output is correct
5 Execution timed out 1099 ms 2636 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 5 ms 2636 KB Output is correct
5 Execution timed out 1084 ms 2636 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 5 ms 2764 KB Output is correct
5 Execution timed out 1094 ms 2636 KB Time limit exceeded
6 Halted 0 ms 0 KB -