oj.uz

Submission #941113

# Submission time Handle Problem Language Result Execution time Memory
941113 2024-03-08T07:22:29 Z Sir_Ahmed_Imran Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 117716 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(){
    L0TA;
    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 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 7 ms 25944 KB Output is correct
5 Correct 7 ms 25692 KB Output is correct
6 Correct 8 ms 25948 KB Output is correct
7 Correct 13 ms 26968 KB Output is correct
8 Correct 6 ms 25948 KB Output is correct
9 Correct 107 ms 35336 KB Output is correct
10 Correct 7 ms 25948 KB Output is correct
11 Correct 6 ms 25948 KB Output is correct
12 Correct 78 ms 35488 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25692 KB Output is correct
2 Correct 5 ms 25688 KB Output is correct
3 Correct 5 ms 25692 KB Output is correct
4 Correct 7 ms 25948 KB Output is correct
5 Correct 6 ms 25692 KB Output is correct
6 Correct 8 ms 26156 KB Output is correct
7 Correct 13 ms 27128 KB Output is correct
8 Correct 6 ms 25944 KB Output is correct
9 Correct 74 ms 35424 KB Output is correct
10 Correct 6 ms 25948 KB Output is correct
11 Correct 7 ms 26040 KB Output is correct
12 Correct 71 ms 35560 KB Output is correct
13 Correct 58 ms 44052 KB Output is correct
14 Correct 51 ms 39888 KB Output is correct
15 Correct 63 ms 35584 KB Output is correct
16 Correct 59 ms 44072 KB Output is correct
17 Correct 84 ms 35920 KB Output is correct
18 Correct 78 ms 37944 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25688 KB Output is correct
2 Correct 6 ms 25692 KB Output is correct
3 Correct 5 ms 25692 KB Output is correct
4 Correct 7 ms 26204 KB Output is correct
5 Correct 6 ms 25692 KB Output is correct
6 Correct 7 ms 25948 KB Output is correct
7 Correct 13 ms 27092 KB Output is correct
8 Correct 7 ms 25948 KB Output is correct
9 Correct 93 ms 35408 KB Output is correct
10 Correct 6 ms 25944 KB Output is correct
11 Correct 7 ms 25948 KB Output is correct
12 Correct 71 ms 35532 KB Output is correct
13 Correct 67 ms 43968 KB Output is correct
14 Correct 63 ms 39892 KB Output is correct
15 Correct 107 ms 35628 KB Output is correct
16 Correct 64 ms 44168 KB Output is correct
17 Correct 60 ms 35904 KB Output is correct
18 Correct 65 ms 37968 KB Output is correct
19 Correct 429 ms 117716 KB Output is correct
20 Execution timed out 505 ms 103488 KB Time limit exceeded
21 Halted 0 ms 0 KB -