oj.uz

Submission #979415

# Submission time Handle Problem Language Result Execution time Memory
979415 2024-05-10T22:07:21 Z AdamGS Split the Attractions (IOI19_split) C++17
40 / 100
 97 ms 30884 KB 
#include "split.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1e5+7;
vector<int>V[LIM], G[LIM], P[LIM], ans;
vector<pair<int,int>>S;
int odl[LIM], pre[LIM], ile[LIM], lpre;
void DFS(int x) {
  pre[x]=++lpre;
  ile[x]=1;
  for(auto i : V[x]) {
    if(!pre[i]) {
      G[x].pb(i);
      DFS(i);
      ile[x]+=ile[i];
    } else if(pre[i]<pre[x]) P[x].pb(i);
  }
}
void DFS2(int x, int k) {
  if(!S[k].st || ans[x]) return;
  ans[x]=S[k].nd;
  --S[k].st;
  for(auto i : G[x]) DFS2(i, k);
}
vector<int>find_split(int n, int a, int b, int c, vector<int>p, vector<int>q) {
  rep(i, n) ans.pb(0);
  S.pb({a, 1});
  S.pb({b, 2});
  S.pb({c, 3});
  sort(all(S));
  rep(i, p.size()) {
    V[p[i]].pb(q[i]);
    V[q[i]].pb(p[i]);
  }
  DFS(0);
  rep(j, 2) {
    rep(i, n) if(ile[i]>=S[0].st && n-ile[i]>=S[1].st) {
      DFS2(i, 0);
      DFS2(0, 1);
      rep(l, n) if(!ans[l]) ans[l]=S[2].nd;
      return ans;
    }
    swap(S[0], S[1]);
  }
  return ans;
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:5:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
split.cpp:37:3: note: in expansion of macro 'rep'
   37 |   rep(i, p.size()) {
      |   ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8284 KB ok, correct split
2 Correct 2 ms 8284 KB ok, correct split
3 Correct 3 ms 8284 KB ok, correct split
4 Correct 2 ms 8280 KB ok, correct split
5 Correct 2 ms 8280 KB ok, correct split
6 Correct 2 ms 8284 KB ok, correct split
7 Correct 70 ms 30280 KB ok, correct split
8 Correct 68 ms 27596 KB ok, correct split
9 Correct 74 ms 26908 KB ok, correct split
10 Correct 67 ms 30884 KB ok, correct split
11 Correct 70 ms 30736 KB ok, correct split

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB ok, correct split
2 Correct 2 ms 8284 KB ok, correct split
3 Correct 2 ms 8284 KB ok, correct split
4 Correct 97 ms 26348 KB ok, correct split
5 Correct 59 ms 19912 KB ok, correct split
6 Correct 78 ms 30772 KB ok, correct split
7 Correct 70 ms 27336 KB ok, correct split
8 Correct 90 ms 23640 KB ok, correct split
9 Correct 61 ms 21448 KB ok, correct split
10 Correct 49 ms 18592 KB ok, correct split
11 Correct 48 ms 18804 KB ok, correct split
12 Correct 51 ms 19176 KB ok, correct split

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB ok, correct split
2 Correct 57 ms 19916 KB ok, correct split
3 Correct 23 ms 13216 KB ok, correct split
4 Correct 3 ms 8484 KB ok, correct split
5 Correct 67 ms 24548 KB ok, correct split
6 Correct 67 ms 24268 KB ok, correct split
7 Correct 65 ms 23960 KB ok, correct split
8 Correct 68 ms 25548 KB ok, correct split
9 Correct 65 ms 23760 KB ok, correct split
10 Correct 17 ms 12244 KB ok, no valid answer
11 Correct 27 ms 14244 KB ok, no valid answer
12 Correct 51 ms 19404 KB ok, no valid answer
13 Correct 57 ms 19912 KB ok, no valid answer
14 Correct 45 ms 19148 KB ok, no valid answer

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB ok, correct split
2 Correct 2 ms 8284 KB ok, no valid answer
3 Correct 2 ms 8284 KB ok, correct split
4 Correct 3 ms 8280 KB ok, correct split
5 Correct 2 ms 8284 KB ok, correct split
6 Correct 2 ms 8284 KB ok, correct split
7 Correct 2 ms 8284 KB ok, correct split
8 Correct 2 ms 8284 KB ok, correct split
9 Correct 4 ms 8796 KB ok, correct split
10 Correct 4 ms 8792 KB ok, correct split
11 Correct 3 ms 8436 KB ok, correct split
12 Correct 4 ms 8796 KB ok, correct split
13 Correct 2 ms 8284 KB ok, correct split
14 Correct 3 ms 8284 KB ok, correct split
15 Correct 2 ms 8280 KB ok, correct split
16 Correct 2 ms 8284 KB ok, correct split
17 Correct 2 ms 8284 KB ok, correct split
18 Correct 2 ms 8284 KB ok, correct split
19 Correct 2 ms 8540 KB ok, correct split
20 Correct 3 ms 8476 KB ok, correct split
21 Correct 3 ms 8692 KB ok, correct split
22 Correct 4 ms 8796 KB ok, correct split
23 Correct 3 ms 8776 KB ok, correct split
24 Correct 4 ms 8796 KB ok, correct split
25 Correct 3 ms 8796 KB ok, correct split
26 Incorrect 4 ms 8796 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8284 KB ok, correct split
2 Correct 2 ms 8284 KB ok, correct split
3 Correct 3 ms 8284 KB ok, correct split
4 Correct 2 ms 8280 KB ok, correct split
5 Correct 2 ms 8280 KB ok, correct split
6 Correct 2 ms 8284 KB ok, correct split
7 Correct 70 ms 30280 KB ok, correct split
8 Correct 68 ms 27596 KB ok, correct split
9 Correct 74 ms 26908 KB ok, correct split
10 Correct 67 ms 30884 KB ok, correct split
11 Correct 70 ms 30736 KB ok, correct split
12 Correct 2 ms 8284 KB ok, correct split
13 Correct 2 ms 8284 KB ok, correct split
14 Correct 2 ms 8284 KB ok, correct split
15 Correct 97 ms 26348 KB ok, correct split
16 Correct 59 ms 19912 KB ok, correct split
17 Correct 78 ms 30772 KB ok, correct split
18 Correct 70 ms 27336 KB ok, correct split
19 Correct 90 ms 23640 KB ok, correct split
20 Correct 61 ms 21448 KB ok, correct split
21 Correct 49 ms 18592 KB ok, correct split
22 Correct 48 ms 18804 KB ok, correct split
23 Correct 51 ms 19176 KB ok, correct split
24 Correct 2 ms 8284 KB ok, correct split
25 Correct 57 ms 19916 KB ok, correct split
26 Correct 23 ms 13216 KB ok, correct split
27 Correct 3 ms 8484 KB ok, correct split
28 Correct 67 ms 24548 KB ok, correct split
29 Correct 67 ms 24268 KB ok, correct split
30 Correct 65 ms 23960 KB ok, correct split
31 Correct 68 ms 25548 KB ok, correct split
32 Correct 65 ms 23760 KB ok, correct split
33 Correct 17 ms 12244 KB ok, no valid answer
34 Correct 27 ms 14244 KB ok, no valid answer
35 Correct 51 ms 19404 KB ok, no valid answer
36 Correct 57 ms 19912 KB ok, no valid answer
37 Correct 45 ms 19148 KB ok, no valid answer
38 Correct 2 ms 8284 KB ok, correct split
39 Correct 2 ms 8284 KB ok, no valid answer
40 Correct 2 ms 8284 KB ok, correct split
41 Correct 3 ms 8280 KB ok, correct split
42 Correct 2 ms 8284 KB ok, correct split
43 Correct 2 ms 8284 KB ok, correct split
44 Correct 2 ms 8284 KB ok, correct split
45 Correct 2 ms 8284 KB ok, correct split
46 Correct 4 ms 8796 KB ok, correct split
47 Correct 4 ms 8792 KB ok, correct split
48 Correct 3 ms 8436 KB ok, correct split
49 Correct 4 ms 8796 KB ok, correct split
50 Correct 2 ms 8284 KB ok, correct split
51 Correct 3 ms 8284 KB ok, correct split
52 Correct 2 ms 8280 KB ok, correct split
53 Correct 2 ms 8284 KB ok, correct split
54 Correct 2 ms 8284 KB ok, correct split
55 Correct 2 ms 8284 KB ok, correct split
56 Correct 2 ms 8540 KB ok, correct split
57 Correct 3 ms 8476 KB ok, correct split
58 Correct 3 ms 8692 KB ok, correct split
59 Correct 4 ms 8796 KB ok, correct split
60 Correct 3 ms 8776 KB ok, correct split
61 Correct 4 ms 8796 KB ok, correct split
62 Correct 3 ms 8796 KB ok, correct split
63 Incorrect 4 ms 8796 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -