oj.uz

Submission #941111

# Submission time Handle Problem Language Result Execution time Memory
941111 2024-03-08T07:21:19 Z Sir_Ahmed_Imran Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 124092 KB 
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define append push_back
#define add insert
#define nl "\n"
#define ff first
#define ss second
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL)
#define N 500001
int st;
set<int> a[N];
vector<int> x;
int vis[N];
void dfs(int v){
    int u;
    vis[v]=1;
    x.append(v);
    while(!a[v].empty()){
        u=*a[v].begin();
        a[v].erase(u);
        a[u].erase(v);
        if(vis[u]){
            cout<<u<<' ';
            while(x.back()!=u){
                cout<<x.back()<<' ';
                vis[x.back()]=0;
                x.pop_back();
            }
            cout<<nl;
            st=u;
        }
        else dfs(u);
        if(v!=st) return; 
    }
}
void solve(){
    int n,m,o,p,q,r;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>p>>q;
        a[p].add(q);
        a[q].add(p);
    }
    for(int i=1;i<=n;i++)
        if(!a[i].empty())
            dfs(i);
}
int main(){
    solve();
    return 0;
}

Compilation message

postmen.cpp: In function 'void solve()':
postmen.cpp:41:13: warning: unused variable 'o' [-Wunused-variable]
   41 |     int n,m,o,p,q,r;
      |             ^
postmen.cpp:41:19: warning: unused variable 'r' [-Wunused-variable]
   41 |     int n,m,o,p,q,r;
      |                   ^

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 25692 KB Output is correct
2 Correct 6 ms 25692 KB Output is correct
3 Correct 5 ms 25688 KB Output is correct
4 Correct 7 ms 25948 KB Output is correct
5 Correct 6 ms 25816 KB Output is correct
6 Correct 11 ms 25972 KB Output is correct
7 Correct 19 ms 27224 KB Output is correct
8 Correct 7 ms 26200 KB Output is correct
9 Correct 107 ms 36184 KB Output is correct
10 Correct 8 ms 25948 KB Output is correct
11 Correct 7 ms 25948 KB Output is correct
12 Correct 118 ms 36428 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25688 KB Output is correct
2 Correct 5 ms 25692 KB Output is correct
3 Correct 5 ms 25692 KB Output is correct
4 Correct 7 ms 25944 KB Output is correct
5 Correct 6 ms 25692 KB Output is correct
6 Correct 9 ms 25948 KB Output is correct
7 Correct 21 ms 27088 KB Output is correct
8 Correct 7 ms 25944 KB Output is correct
9 Correct 102 ms 35984 KB Output is correct
10 Correct 8 ms 25948 KB Output is correct
11 Correct 7 ms 25944 KB Output is correct
12 Correct 93 ms 36436 KB Output is correct
13 Correct 85 ms 45348 KB Output is correct
14 Correct 119 ms 41164 KB Output is correct
15 Correct 87 ms 36436 KB Output is correct
16 Correct 87 ms 45280 KB Output is correct
17 Correct 88 ms 36752 KB Output is correct
18 Correct 82 ms 38992 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25692 KB Output is correct
2 Correct 5 ms 25692 KB Output is correct
3 Correct 5 ms 25692 KB Output is correct
4 Correct 8 ms 25948 KB Output is correct
5 Correct 6 ms 25692 KB Output is correct
6 Correct 9 ms 26052 KB Output is correct
7 Correct 21 ms 27228 KB Output is correct
8 Correct 7 ms 25948 KB Output is correct
9 Correct 143 ms 36296 KB Output is correct
10 Correct 8 ms 25948 KB Output is correct
11 Correct 8 ms 26204 KB Output is correct
12 Correct 114 ms 36292 KB Output is correct
13 Correct 102 ms 45460 KB Output is correct
14 Correct 84 ms 41168 KB Output is correct
15 Correct 80 ms 36572 KB Output is correct
16 Correct 101 ms 45520 KB Output is correct
17 Correct 81 ms 36780 KB Output is correct
18 Correct 86 ms 39036 KB Output is correct
19 Execution timed out 583 ms 124092 KB Time limit exceeded
20 Halted 0 ms 0 KB -