oj.uz

답안 #978781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978781 2024-05-09T16:54:07 Z AdamGS Split the Attractions (IOI19_split) C++17
40 / 100
 93 ms 29640 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], P[LIM], G[LIM], ans;
vector<pair<int,int>>S;
int pre[LIM], odl[LIM], ile[LIM], lpre, X, Y;
void DFS(int x) {
  pre[x]=++lpre;
  for(auto i : V[x]) {
    if(!pre[i]) {
      P[x].pb(i);
      DFS(i);
    } else if(pre[i]<pre[x]) G[x].pb(i);
  }
}
void DFS2(int x) {
  ile[x]=1;
  for(auto i : P[x]) {
    odl[i]=odl[x]+1;
    DFS2(i);
    ile[x]+=ile[i];
  }
}
void DFS3(int x, int k) {
  if(!X || ans[x]) return;
  ans[x]=k;
  --X;
  for(auto i : P[x]) DFS3(i, k);
}
void DFS4(int x, int k) {
  if(ans[x]) return;
  ans[x]=k;
  for(auto i : P[x]) DFS4(i, k);
}
void DFS7(int x, int k) {
  if(X) ans[x]=k; else ans[x]=S[2].nd;
  for(auto i : P[x]) DFS7(i, k);
}
void DFS5(int x, bool c, int k, int p) {
  for(auto i : G[x]) if(odl[i]<k) c=true;
  if(c) {
    if(X) DFS7(x, p);
    return;
  }
  for(auto i : P[x]) DFS5(i, c, k, p);
}
bool DFS6(int x, int k) {
  bool c=true;
  if(S[2].st==0) c=false;
  if(ans[x]==k) c=false;
  for(auto i : P[x]) c&=DFS6(i, k);
  if(c) {
    --S[2].st;
    ans[x]=S[2].nd;
  }
  return c;
}
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);
  DFS2(0);
  rep(i, n) if(ile[i]>=S[0].st && n-ile[i]>=S[1].st) {
    X=S[0].st;
    DFS3(i, S[0].nd);
    X=S[1].st;
    DFS3(0, S[1].nd);
    rep(j, n) if(!ans[j]) ans[j]=S[2].nd;
    return ans;
  }
  rep(i, n) if(ile[i]>=S[1].st && n-ile[i]>=S[0].st) {
    X=S[1].st;
    DFS3(i, S[1].nd);
    X=S[0].st;
    DFS3(0, S[0].nd);
    rep(j, n) if(!ans[j]) ans[j]=S[2].nd;
    return ans;
  }
  pair<int,int>mi={n, n};
  rep(i, n) if(ile[i]>=S[0].st) mi=min(mi, {ile[i], i});
  if(!mi.nd) return ans;
  X=S[1].st-(n-mi.st);
  DFS4(mi.nd, S[0].nd);
  DFS4(0, S[1].nd);
  for(auto i : P[mi.nd]) DFS5(i, false, odl[mi.nd], S[1].nd);
  if(!X) {
    DFS6(0, S[1].nd);
    return ans;
  }
  rep(i, n) ans[i]=0;
  mi={n, n};
  rep(i, n) if(ile[i]>=S[1].st) mi=min(mi, {ile[i], i});
  if(!mi.nd) return ans;
  X=S[0].st-(n-mi.st);
  DFS4(mi.nd, S[1].nd);
  DFS4(0, S[0].nd);
  for(auto i : P[mi.nd]) DFS5(i, false, odl[mi.nd], S[0].nd);
  if(X) rep(i, n) ans[i]=0;
  else DFS6(0, S[0].nd);
  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:71:3: note: in expansion of macro 'rep'
   71 |   rep(i, p.size()) {
      |   ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 8284 KB ok, correct split
5 Correct 3 ms 8284 KB ok, correct split
6 Correct 2 ms 8280 KB ok, correct split
7 Correct 76 ms 29108 KB ok, correct split
8 Correct 82 ms 26536 KB ok, correct split
9 Correct 88 ms 25512 KB ok, correct split
10 Correct 90 ms 29524 KB ok, correct split
11 Correct 75 ms 29612 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB ok, correct split
2 Correct 2 ms 8284 KB ok, correct split
3 Correct 2 ms 8280 KB ok, correct split
4 Correct 89 ms 24628 KB ok, correct split
5 Correct 62 ms 18868 KB ok, correct split
6 Correct 93 ms 29640 KB ok, correct split
7 Correct 72 ms 26212 KB ok, correct split
8 Correct 92 ms 21452 KB ok, correct split
9 Correct 86 ms 20424 KB ok, correct split
10 Correct 50 ms 17844 KB ok, correct split
11 Correct 45 ms 17876 KB ok, correct split
12 Correct 47 ms 17864 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8280 KB ok, correct split
2 Correct 58 ms 18892 KB ok, correct split
3 Correct 21 ms 12760 KB ok, correct split
4 Correct 2 ms 8284 KB ok, correct split
5 Correct 79 ms 23500 KB ok, correct split
6 Correct 69 ms 23080 KB ok, correct split
7 Correct 67 ms 22984 KB ok, correct split
8 Correct 76 ms 24524 KB ok, correct split
9 Correct 86 ms 22656 KB ok, correct split
10 Correct 20 ms 11988 KB ok, no valid answer
11 Correct 29 ms 13784 KB ok, no valid answer
12 Correct 58 ms 18380 KB ok, no valid answer
13 Correct 68 ms 18776 KB ok, no valid answer
14 Correct 51 ms 17920 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 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 2 ms 8284 KB ok, correct split
5 Correct 2 ms 8284 KB ok, correct split
6 Correct 3 ms 8336 KB ok, correct split
7 Correct 3 ms 8276 KB ok, correct split
8 Correct 2 ms 8280 KB ok, correct split
9 Correct 4 ms 8796 KB ok, correct split
10 Correct 4 ms 8736 KB ok, correct split
11 Correct 2 ms 8284 KB ok, correct split
12 Correct 5 ms 8664 KB ok, correct split
13 Correct 2 ms 8280 KB ok, correct split
14 Correct 2 ms 8284 KB ok, correct split
15 Correct 2 ms 8284 KB ok, correct split
16 Correct 2 ms 8280 KB ok, correct split
17 Correct 3 ms 8280 KB ok, correct split
18 Correct 3 ms 8284 KB ok, correct split
19 Correct 3 ms 8536 KB ok, correct split
20 Correct 3 ms 8540 KB ok, correct split
21 Correct 3 ms 8796 KB ok, correct split
22 Correct 3 ms 8796 KB ok, correct split
23 Correct 3 ms 8728 KB ok, correct split
24 Correct 3 ms 8796 KB ok, correct split
25 Correct 3 ms 8796 KB ok, correct split
26 Incorrect 4 ms 8540 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 8284 KB ok, correct split
5 Correct 3 ms 8284 KB ok, correct split
6 Correct 2 ms 8280 KB ok, correct split
7 Correct 76 ms 29108 KB ok, correct split
8 Correct 82 ms 26536 KB ok, correct split
9 Correct 88 ms 25512 KB ok, correct split
10 Correct 90 ms 29524 KB ok, correct split
11 Correct 75 ms 29612 KB ok, correct split
12 Correct 2 ms 8280 KB ok, correct split
13 Correct 2 ms 8284 KB ok, correct split
14 Correct 2 ms 8280 KB ok, correct split
15 Correct 89 ms 24628 KB ok, correct split
16 Correct 62 ms 18868 KB ok, correct split
17 Correct 93 ms 29640 KB ok, correct split
18 Correct 72 ms 26212 KB ok, correct split
19 Correct 92 ms 21452 KB ok, correct split
20 Correct 86 ms 20424 KB ok, correct split
21 Correct 50 ms 17844 KB ok, correct split
22 Correct 45 ms 17876 KB ok, correct split
23 Correct 47 ms 17864 KB ok, correct split
24 Correct 2 ms 8280 KB ok, correct split
25 Correct 58 ms 18892 KB ok, correct split
26 Correct 21 ms 12760 KB ok, correct split
27 Correct 2 ms 8284 KB ok, correct split
28 Correct 79 ms 23500 KB ok, correct split
29 Correct 69 ms 23080 KB ok, correct split
30 Correct 67 ms 22984 KB ok, correct split
31 Correct 76 ms 24524 KB ok, correct split
32 Correct 86 ms 22656 KB ok, correct split
33 Correct 20 ms 11988 KB ok, no valid answer
34 Correct 29 ms 13784 KB ok, no valid answer
35 Correct 58 ms 18380 KB ok, no valid answer
36 Correct 68 ms 18776 KB ok, no valid answer
37 Correct 51 ms 17920 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 2 ms 8284 KB ok, correct split
42 Correct 2 ms 8284 KB ok, correct split
43 Correct 3 ms 8336 KB ok, correct split
44 Correct 3 ms 8276 KB ok, correct split
45 Correct 2 ms 8280 KB ok, correct split
46 Correct 4 ms 8796 KB ok, correct split
47 Correct 4 ms 8736 KB ok, correct split
48 Correct 2 ms 8284 KB ok, correct split
49 Correct 5 ms 8664 KB ok, correct split
50 Correct 2 ms 8280 KB ok, correct split
51 Correct 2 ms 8284 KB ok, correct split
52 Correct 2 ms 8284 KB ok, correct split
53 Correct 2 ms 8280 KB ok, correct split
54 Correct 3 ms 8280 KB ok, correct split
55 Correct 3 ms 8284 KB ok, correct split
56 Correct 3 ms 8536 KB ok, correct split
57 Correct 3 ms 8540 KB ok, correct split
58 Correct 3 ms 8796 KB ok, correct split
59 Correct 3 ms 8796 KB ok, correct split
60 Correct 3 ms 8728 KB ok, correct split
61 Correct 3 ms 8796 KB ok, correct split
62 Correct 3 ms 8796 KB ok, correct split
63 Incorrect 4 ms 8540 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -