oj.uz

Submission #699907

# Submission time Handle Problem Language Result Execution time Memory
699907 2023-02-18T08:46:49 Z cig32 Amusement Park (JOI17_amusement_park) C++17
10 / 100
 23 ms 4376 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];
  
  set<int> stt;
  stt.insert(val[P]);
  for(int i=0; ; i++) {
    idx++;
    idx %= (int)(et.size());
    node = et[idx];
    res[val[node]] = Move(node);
    stt.insert(val[node]);
    if(stt.size()==60)break;
  }
  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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1152 KB Output is correct
2 Incorrect 1 ms 1160 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4376 KB Output is correct
2 Correct 23 ms 4360 KB Output is correct
3 Correct 23 ms 4292 KB Output is correct
4 Correct 11 ms 2908 KB Output is correct
5 Correct 11 ms 3412 KB Output is correct
6 Correct 11 ms 3240 KB Output is correct
7 Correct 11 ms 3228 KB Output is correct
8 Correct 12 ms 3416 KB Output is correct
9 Correct 13 ms 3300 KB Output is correct
10 Correct 13 ms 2936 KB Output is correct
11 Correct 13 ms 3020 KB Output is correct
12 Correct 11 ms 2732 KB Output is correct
13 Correct 11 ms 2744 KB Output is correct
14 Correct 11 ms 2868 KB Output is correct
15 Correct 11 ms 2892 KB Output is correct
16 Correct 11 ms 2892 KB Output is correct
17 Correct 13 ms 2868 KB Output is correct
18 Correct 12 ms 2912 KB Output is correct
19 Correct 13 ms 2852 KB Output is correct
20 Incorrect 10 ms 3516 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1160 KB Output is correct
2 Correct 0 ms 1160 KB Output is correct
3 Correct 0 ms 1160 KB Output is correct
4 Correct 2 ms 1564 KB Output is correct
5 Correct 2 ms 1572 KB Output is correct
6 Correct 2 ms 1632 KB Output is correct
7 Correct 2 ms 1560 KB Output is correct
8 Correct 3 ms 1572 KB Output is correct
9 Correct 10 ms 4004 KB Output is correct
10 Correct 9 ms 4084 KB Output is correct
11 Correct 9 ms 4148 KB Output is correct
12 Correct 1 ms 1160 KB Output is correct
13 Correct 2 ms 1160 KB Output is correct
14 Correct 1 ms 1164 KB Output is correct
15 Correct 2 ms 1152 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4348 KB Output is correct
2 Correct 20 ms 4336 KB Output is correct
3 Partially correct 22 ms 4372 KB Partially correct
4 Correct 12 ms 2964 KB Output is correct
5 Partially correct 16 ms 3772 KB Partially correct
6 Correct 13 ms 3396 KB Output is correct
7 Correct 13 ms 3400 KB Output is correct
8 Correct 13 ms 3140 KB Output is correct
9 Correct 13 ms 3212 KB Output is correct
10 Correct 15 ms 3016 KB Output is correct
11 Correct 12 ms 3004 KB Output is correct
12 Correct 11 ms 2780 KB Output is correct
13 Correct 13 ms 2736 KB Output is correct
14 Correct 11 ms 2876 KB Output is correct
15 Correct 12 ms 2904 KB Output is correct
16 Correct 11 ms 2884 KB Output is correct
17 Correct 13 ms 2892 KB Output is correct
18 Correct 15 ms 3012 KB Output is correct
19 Correct 12 ms 2880 KB Output is correct
20 Incorrect 9 ms 3456 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 4304 KB Output is correct
2 Incorrect 19 ms 4312 KB Output isn't correct
3 Halted 0 ms 0 KB -