oj.uz

Submission #699857

# Submission time Handle Problem Language Result Execution time Memory
699857 2023-02-18T07:21:29 Z cig32 Amusement Park (JOI17_amusement_park) C++17
0 / 100
 25 ms 4256 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]));
  MessageBoard(node, (res > 0 ? 1 : 0));
  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 nxt;
static vector<int> et;
static void dfs(int node, int par) {
  val[node] = nxt;
  nxt = (nxt+1) % 60;
  vis[node] = 1;
  et.push_back(node);
  for(int x: adj[node]) {
    if(!vis[x]) {
      dfs(x, node);
      et.push_back(node);
    }
  }
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
  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] = 0;
  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];
  for(int i=val[P]-1; i>=0; i--) {
    while(idx-1 >= 0 && val[et[idx]] != i) {
      idx--;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  for(int i=1; i<60; i++) {
    while(idx+1 < et.size() && val[et[idx]] != i) {
      idx++;
      int rm = Move(et[idx]);
      node = et[idx];
      res[val[node]] = rm;
    }
  }
  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:41:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for(int i=0; i<et.size(); i++) {
      |                ~^~~~~~~~~~
Ioi.cpp:54:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     while(idx+1 < et.size() && val[et[idx]] != i) {
      |           ~~~~~~^~~~~~~~~~~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4256 KB Output is correct
2 Correct 22 ms 4176 KB Output is correct
3 Correct 24 ms 4132 KB Output is correct
4 Correct 13 ms 2864 KB Output is correct
5 Correct 12 ms 3316 KB Output is correct
6 Correct 13 ms 3152 KB Output is correct
7 Correct 12 ms 3140 KB Output is correct
8 Correct 12 ms 3276 KB Output is correct
9 Correct 13 ms 3288 KB Output is correct
10 Correct 12 ms 3012 KB Output is correct
11 Correct 13 ms 3028 KB Output is correct
12 Correct 11 ms 2740 KB Output is correct
13 Correct 11 ms 2712 KB Output is correct
14 Correct 12 ms 2756 KB Output is correct
15 Correct 13 ms 2756 KB Output is correct
16 Correct 14 ms 2764 KB Output is correct
17 Correct 12 ms 2808 KB Output is correct
18 Correct 12 ms 2876 KB Output is correct
19 Correct 13 ms 2956 KB Output is correct
20 Incorrect 11 ms 3408 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1160 KB Output is correct
2 Correct 1 ms 1140 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 2 ms 1572 KB Output is correct
5 Correct 2 ms 1564 KB Output is correct
6 Correct 3 ms 1564 KB Output is correct
7 Correct 2 ms 1568 KB Output is correct
8 Incorrect 2 ms 1572 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 4184 KB Partially correct
2 Correct 22 ms 4220 KB Output is correct
3 Partially correct 22 ms 4188 KB Partially correct
4 Partially correct 15 ms 3176 KB Partially correct
5 Partially correct 13 ms 3632 KB Partially correct
6 Partially correct 13 ms 3252 KB Partially correct
7 Correct 14 ms 3308 KB Output is correct
8 Correct 14 ms 3076 KB Output is correct
9 Partially correct 15 ms 3164 KB Partially correct
10 Correct 12 ms 3112 KB Output is correct
11 Partially correct 13 ms 3116 KB Partially correct
12 Partially correct 11 ms 2660 KB Partially correct
13 Partially correct 12 ms 2740 KB Partially correct
14 Partially correct 13 ms 2964 KB Partially correct
15 Partially correct 13 ms 2992 KB Partially correct
16 Partially correct 13 ms 3024 KB Partially correct
17 Partially correct 13 ms 3020 KB Partially correct
18 Partially correct 13 ms 3036 KB Partially correct
19 Partially correct 13 ms 3036 KB Partially correct
20 Incorrect 12 ms 3628 KB Wrong Answer [7]
21 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4208 KB Output is correct
2 Incorrect 25 ms 4164 KB Output isn't correct
3 Halted 0 ms 0 KB -