oj.uz

답안 #700226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
700226 2023-02-19T01:49:04 Z cig32 Amusement Park (JOI17_amusement_park) C++17
63 / 100
 23 ms 4868 KB 
#include "Joi.h"
#include "bits/stdc++.h"
using namespace std;

static vector<int> adj2[12269];
static bool vis2[12269];
static int val2[12269];
static int nxt2;
static void dfs2(int node, long long X, int par) {
  val2[node] = nxt2;
  nxt2 = (nxt2 + 1) % 60;
  long long res = (X & (1ll << val2[node]));
  if(res > 0) res = 1;
  MessageBoard(node, (int) res);
  vis2[node] = 1;
  for(int x: adj2[node]) {
    if(!vis2[x]) {
      dfs2(x, X, node);
    }
  }
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
  for(int i=0; i<M; i++) {
    adj2[A[i]].push_back(B[i]);
    adj2[B[i]].push_back(A[i]);
  }
  for(int i=0; i<N; i++) {
    sort(adj2[i].begin(), adj2[i].end());
  }
  for(int i=0; i<N; i++) {
    vis2[i] = 0;
  }
  dfs2(0, X, -1);
}


#include "Ioi.h"
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e4 + 10;
static vector<int> adj[MAXN];
static bool vis[MAXN];
static int val[MAXN];
static int sz[MAXN];
static int nxt;
static vector<int> et;
static int p[MAXN];
static void dfs(int node, int par) {
  val[node] = nxt;
  nxt = (nxt+1) % 60;
  vis[node] = 1;
  sz[node] = 1;
  p[node] = par;
  et.push_back(node);
  for(int x: adj[node]) {
    if(!vis[x]) {
      dfs(x, node);
      et.push_back(node);
      sz[node] += sz[x];
    }
  }
}
 
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  nxt = 0;
  et.clear();
  for(int i=0; i<N; i++) {
    adj[i].clear();
  }
  for(int i=0; i<M; i++) {
    adj[A[i]].push_back(B[i]);
    adj[B[i]].push_back(A[i]);
  }
  for(int i=0; i<N; i++) {
    sort(adj[i].begin(), adj[i].end());
  }
  for(int i=0; i<N; i++) {
    vis[i] = 0;
  }
  dfs(0, -1);
  long long ans = 0;
  int res[60];
  for(int i=0; i<60; i++) res[i] = -1;
  res[val[P]] = V;
  int l[N];
  for(int i=0; i<N; i++) l[i] = -1;
  for(int i=0; i<et.size(); i++) {
    if(l[et[i]] == -1) l[et[i]] = i;
  }
  int node = P, idx = l[P];
  
  if(sz[node]>=60) {
    set<int> st;
    st.insert(val[P]);
    while(st.size() != 60) {
      idx++;
      node = et[idx];
      res[val[node]] = Move(node);
      st.insert(val[node]);
    }
  }
  else {
    set<int>st;
    st.insert(val[P]);
    for(int i=0; sz[node]<50; i++) {
      if(p[node] != -1) {
        node=p[node];
        idx=l[node];
        res[val[node]]=Move(node);
        st.insert(val[node]);
      }
      else break;
    }
    while(st.size() != 60) {
      idx++;
      idx %= (int) et.size();
      node = et[idx];
      res[val[node]] = Move(node);
      st.insert(val[node]);
    }
 
  }
 
  for(int i=0; i<60; i++) {
    if(res[i]) ans += (1ll << i);
  }
  return ans;
}

Compilation message

Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:51:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for(int i=0; i<et.size(); i++) {
      |                ~^~~~~~~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1156 KB Output is correct
2 Correct 1 ms 1156 KB Output is correct
3 Correct 2 ms 1296 KB Output is correct
4 Correct 1 ms 1164 KB Output is correct
5 Correct 1 ms 1164 KB Output is correct
6 Correct 2 ms 1156 KB Output is correct
7 Correct 1 ms 1288 KB Output is correct
8 Correct 2 ms 1304 KB Output is correct
9 Correct 2 ms 1288 KB Output is correct
10 Correct 2 ms 1156 KB Output is correct
11 Correct 5 ms 1512 KB Output is correct
12 Incorrect 1 ms 1164 KB Wrong Answer [7]
13 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 4756 KB Output is correct
2 Correct 20 ms 4812 KB Output is correct
3 Correct 22 ms 4780 KB Output is correct
4 Correct 13 ms 3128 KB Output is correct
5 Correct 13 ms 3732 KB Output is correct
6 Correct 13 ms 3492 KB Output is correct
7 Correct 13 ms 3488 KB Output is correct
8 Correct 13 ms 3500 KB Output is correct
9 Correct 13 ms 3488 KB Output is correct
10 Correct 13 ms 3128 KB Output is correct
11 Correct 11 ms 3368 KB Output is correct
12 Correct 11 ms 3040 KB Output is correct
13 Correct 12 ms 2964 KB Output is correct
14 Correct 13 ms 3096 KB Output is correct
15 Correct 13 ms 3108 KB Output is correct
16 Correct 13 ms 3108 KB Output is correct
17 Correct 13 ms 3104 KB Output is correct
18 Correct 13 ms 3120 KB Output is correct
19 Correct 13 ms 3100 KB Output is correct
20 Correct 11 ms 3764 KB Output is correct
21 Correct 9 ms 3756 KB Output is correct
22 Correct 14 ms 3384 KB Output is correct
23 Correct 17 ms 3476 KB Output is correct
24 Correct 12 ms 3484 KB Output is correct
25 Correct 13 ms 3456 KB Output is correct
26 Correct 13 ms 3504 KB Output is correct
27 Correct 13 ms 3500 KB Output is correct
28 Correct 12 ms 3492 KB Output is correct
29 Correct 11 ms 3384 KB Output is correct
30 Correct 12 ms 3480 KB Output is correct
31 Correct 1 ms 1164 KB Output is correct
32 Correct 1 ms 1160 KB Output is correct
33 Correct 2 ms 1288 KB Output is correct
34 Correct 2 ms 1160 KB Output is correct
35 Incorrect 2 ms 1156 KB Wrong Answer [7]
36 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1156 KB Output is correct
2 Correct 1 ms 1168 KB Output is correct
3 Correct 1 ms 1156 KB Output is correct
4 Correct 2 ms 1580 KB Output is correct
5 Correct 2 ms 1584 KB Output is correct
6 Correct 2 ms 1588 KB Output is correct
7 Correct 2 ms 1588 KB Output is correct
8 Correct 2 ms 1576 KB Output is correct
9 Correct 10 ms 4264 KB Output is correct
10 Correct 10 ms 4396 KB Output is correct
11 Correct 10 ms 4236 KB Output is correct
12 Correct 1 ms 1152 KB Output is correct
13 Correct 1 ms 1156 KB Output is correct
14 Correct 1 ms 1164 KB Output is correct
15 Correct 1 ms 1156 KB Output is correct

Subtask #4
53.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 4868 KB Output is correct
2 Correct 22 ms 4736 KB Output is correct
3 Correct 22 ms 4792 KB Output is correct
4 Correct 13 ms 3136 KB Output is correct
5 Partially correct 13 ms 4016 KB Partially correct
6 Correct 12 ms 3500 KB Output is correct
7 Correct 13 ms 3484 KB Output is correct
8 Correct 13 ms 3308 KB Output is correct
9 Correct 13 ms 3276 KB Output is correct
10 Correct 13 ms 3120 KB Output is correct
11 Correct 13 ms 3124 KB Output is correct
12 Correct 11 ms 2964 KB Output is correct
13 Correct 11 ms 2960 KB Output is correct
14 Correct 12 ms 3056 KB Output is correct
15 Correct 12 ms 3100 KB Output is correct
16 Correct 12 ms 3092 KB Output is correct
17 Correct 12 ms 3144 KB Output is correct
18 Correct 12 ms 3084 KB Output is correct
19 Correct 12 ms 3108 KB Output is correct
20 Correct 10 ms 3748 KB Output is correct
21 Correct 11 ms 3760 KB Output is correct
22 Correct 13 ms 3588 KB Output is correct
23 Correct 14 ms 3476 KB Output is correct
24 Correct 15 ms 3504 KB Output is correct
25 Correct 13 ms 3492 KB Output is correct
26 Correct 15 ms 3488 KB Output is correct
27 Correct 12 ms 3776 KB Output is correct
28 Correct 13 ms 3372 KB Output is correct
29 Correct 13 ms 3220 KB Output is correct
30 Correct 12 ms 3452 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 4684 KB Output is correct
2 Correct 23 ms 4860 KB Output is correct
3 Correct 22 ms 4688 KB Output is correct
4 Correct 13 ms 3108 KB Output is correct
5 Incorrect 12 ms 4116 KB Output isn't correct
6 Halted 0 ms 0 KB -