oj.uz

Submission #227146

# Submission time Handle Problem Language Result Execution time Memory
227146 2020-04-26T09:12:34 Z Bruteforceman Senior Postmen (BOI14_postmen) C++11
100 / 100
 304 ms 41772 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
struct edge {
  int l, r;
  int nxtL, nxtR;
} e[maxn];
int idx[maxn];
int del[maxn];
int st[maxn];
int id;

void dfs(int x) {
  while(idx[x] != -1) {
    int i = idx[x]; 
    int y = e[i].l ^ e[i].r ^ x;
    idx[x] = (e[i].l == x) ? e[i].nxtL : e[i].nxtR;
    if(del[i]) continue; del[i] = true;
    dfs(y);
  }
  st[id++] = x;
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  memset(idx, -1, sizeof idx);
  for(int i = 0; i < m; i++) {
    scanf("%d %d", &e[i].l, &e[i].r);
    e[i].nxtL = idx[e[i].l];
    e[i].nxtR = idx[e[i].r];
    idx[e[i].l] = idx[e[i].r] = i;
  }
  dfs(1);
  memset(del, false, sizeof del);
  stack <int> s;
  for(int i = 0; i < id; i++) {
    int x = st[i];
    s.push(x);
    if(del[x]) {
      do {
        printf("%d ", s.top());
        del[s.top()] = false;
        s.pop();
      } while(x != s.top());
      printf("\n");
    } 
    del[x] = true;
  }
  return 0;
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:18:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(del[i]) continue; del[i] = true;
     ^~
postmen.cpp:18:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     if(del[i]) continue; del[i] = true;
                          ^~~
postmen.cpp: In function 'int main()':
postmen.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &m);
   ~~~~~^~~~~~~~~~~~~~~~~
postmen.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &e[i].l, &e[i].r);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4200 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 8 ms 4224 KB Output is correct
4 Correct 9 ms 4480 KB Output is correct
5 Correct 8 ms 4352 KB Output is correct
6 Correct 10 ms 4460 KB Output is correct
7 Correct 14 ms 5208 KB Output is correct
8 Correct 8 ms 4480 KB Output is correct
9 Correct 44 ms 10488 KB Output is correct
10 Correct 9 ms 4480 KB Output is correct
11 Correct 8 ms 4352 KB Output is correct
12 Correct 49 ms 10744 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4224 KB Output is correct
2 Correct 7 ms 4224 KB Output is correct
3 Correct 7 ms 4276 KB Output is correct
4 Correct 8 ms 4480 KB Output is correct
5 Correct 7 ms 4352 KB Output is correct
6 Correct 10 ms 4480 KB Output is correct
7 Correct 12 ms 5120 KB Output is correct
8 Correct 9 ms 4480 KB Output is correct
9 Correct 54 ms 10464 KB Output is correct
10 Correct 9 ms 4352 KB Output is correct
11 Correct 7 ms 4352 KB Output is correct
12 Correct 52 ms 10620 KB Output is correct
13 Correct 59 ms 11512 KB Output is correct
14 Correct 54 ms 9720 KB Output is correct
15 Correct 64 ms 10748 KB Output is correct
16 Correct 54 ms 11488 KB Output is correct
17 Correct 56 ms 8184 KB Output is correct
18 Correct 64 ms 10464 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4224 KB Output is correct
2 Correct 6 ms 4224 KB Output is correct
3 Correct 6 ms 4224 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 7 ms 4404 KB Output is correct
6 Correct 8 ms 4576 KB Output is correct
7 Correct 13 ms 5224 KB Output is correct
8 Correct 10 ms 4528 KB Output is correct
9 Correct 48 ms 10464 KB Output is correct
10 Correct 8 ms 4352 KB Output is correct
11 Correct 7 ms 4352 KB Output is correct
12 Correct 50 ms 10616 KB Output is correct
13 Correct 57 ms 11512 KB Output is correct
14 Correct 62 ms 9720 KB Output is correct
15 Correct 55 ms 10720 KB Output is correct
16 Correct 81 ms 11512 KB Output is correct
17 Correct 67 ms 8184 KB Output is correct
18 Correct 52 ms 10336 KB Output is correct
19 Correct 292 ms 41720 KB Output is correct
20 Correct 291 ms 33016 KB Output is correct
21 Correct 304 ms 37368 KB Output is correct
22 Correct 288 ms 41772 KB Output is correct
23 Correct 203 ms 35320 KB Output is correct
24 Correct 302 ms 25024 KB Output is correct
25 Correct 292 ms 36204 KB Output is correct