oj.uz

답안 #978790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978790 2024-05-09T17:13:28 Z AdamGS Split the Attractions (IOI19_split) C++17
18 / 100
 2000 ms 29668 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;
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; 
    --X;
  } 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) {
  for(int root=0; root<n; ++root) {
    lpre=X=0;
    ans.clear();
    S.clear();
    rep(i, n) {
      V[i].clear();
      G[i].clear();
      P[i].clear();
      pre[i]=odl[i]=ile[i]=0;
    }
    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(root);
    DFS2(root);
    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(root, 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(root, 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==root) continue;
    X=S[1].st-(n-mi.st);
    DFS4(mi.nd, S[0].nd);
    DFS4(root, S[1].nd);
    for(auto i : P[mi.nd]) DFS5(i, false, odl[mi.nd], S[1].nd);
    if(!X) {
      DFS6(root, S[1].nd);
      return ans;
    }
  }
  rep(i, n) ans[i]=0;
  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:84:5: note: in expansion of macro 'rep'
   84 |     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 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 2 ms 8284 KB ok, correct split
7 Correct 82 ms 29088 KB ok, correct split
8 Correct 96 ms 26472 KB ok, correct split
9 Correct 70 ms 25628 KB ok, correct split
10 Correct 73 ms 29644 KB ok, correct split
11 Correct 74 ms 29644 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8284 KB ok, correct split
2 Correct 2 ms 8284 KB ok, correct split
3 Correct 2 ms 8280 KB ok, correct split
4 Correct 81 ms 24636 KB ok, correct split
5 Correct 66 ms 18892 KB ok, correct split
6 Correct 72 ms 29668 KB ok, correct split
7 Correct 70 ms 26312 KB ok, correct split
8 Correct 83 ms 21452 KB ok, correct split
9 Correct 68 ms 20428 KB ok, correct split
10 Correct 43 ms 17928 KB ok, correct split
11 Correct 43 ms 17876 KB ok, correct split
12 Correct 43 ms 17876 KB ok, correct split

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8284 KB ok, correct split
2 Correct 73 ms 19144 KB ok, correct split
3 Correct 21 ms 12760 KB ok, correct split
4 Correct 2 ms 8284 KB ok, correct split
5 Correct 65 ms 23468 KB ok, correct split
6 Correct 69 ms 23212 KB ok, correct split
7 Correct 74 ms 23020 KB ok, correct split
8 Correct 68 ms 24564 KB ok, correct split
9 Correct 66 ms 22704 KB ok, correct split
10 Execution timed out 2033 ms 11988 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8284 KB ok, correct split
2 Correct 2 ms 8280 KB ok, no valid answer
3 Correct 2 ms 8284 KB ok, correct split
4 Correct 2 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 8796 KB ok, correct split
11 Correct 2 ms 8280 KB ok, correct split
12 Correct 4 ms 8796 KB ok, correct split
13 Correct 2 ms 8284 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 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 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 8796 KB ok, correct split
24 Correct 3 ms 8796 KB ok, correct split
25 Correct 3 ms 8792 KB ok, correct split
26 Correct 3 ms 8796 KB ok, correct split
27 Correct 4 ms 8540 KB ok, correct split
28 Correct 3 ms 8540 KB ok, correct split
29 Correct 3 ms 8284 KB ok, correct split
30 Correct 3 ms 8536 KB ok, correct split
31 Correct 3 ms 8540 KB ok, correct split
32 Correct 2 ms 8284 KB ok, correct split
33 Correct 3 ms 8280 KB ok, correct split
34 Incorrect 3 ms 8540 KB invalid split: #1=1, #2=800, #3=1599
35 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 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 2 ms 8284 KB ok, correct split
7 Correct 82 ms 29088 KB ok, correct split
8 Correct 96 ms 26472 KB ok, correct split
9 Correct 70 ms 25628 KB ok, correct split
10 Correct 73 ms 29644 KB ok, correct split
11 Correct 74 ms 29644 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 8280 KB ok, correct split
15 Correct 81 ms 24636 KB ok, correct split
16 Correct 66 ms 18892 KB ok, correct split
17 Correct 72 ms 29668 KB ok, correct split
18 Correct 70 ms 26312 KB ok, correct split
19 Correct 83 ms 21452 KB ok, correct split
20 Correct 68 ms 20428 KB ok, correct split
21 Correct 43 ms 17928 KB ok, correct split
22 Correct 43 ms 17876 KB ok, correct split
23 Correct 43 ms 17876 KB ok, correct split
24 Correct 2 ms 8284 KB ok, correct split
25 Correct 73 ms 19144 KB ok, correct split
26 Correct 21 ms 12760 KB ok, correct split
27 Correct 2 ms 8284 KB ok, correct split
28 Correct 65 ms 23468 KB ok, correct split
29 Correct 69 ms 23212 KB ok, correct split
30 Correct 74 ms 23020 KB ok, correct split
31 Correct 68 ms 24564 KB ok, correct split
32 Correct 66 ms 22704 KB ok, correct split
33 Execution timed out 2033 ms 11988 KB Time limit exceeded
34 Halted 0 ms 0 KB -