oj.uz

Submission #993964

# Submission time Handle Problem Language Result Execution time Memory
993964 2024-06-06T22:10:50 Z MilosMilutinovic Magic Show (APIO24_show) C++17
0 / 100
 2 ms 1068 KB 
#include "Alice.h"
#include <bits/stdc++.h>

using namespace std;

vector<pair<int, int>> Alice() {
  long long x = setN(5000);
  vector<pair<int, int>> edges;
  edges.emplace_back(1, 2);
  for (int i = 3; i <= 5000; i++) {
    int b = (i % 60);
    if (x >> b & 1) {
      edges.emplace_back(1, i);
    } else {
      edges.emplace_back(2, i);
    }
  }
  return edges;
}

#include <bits/stdc++.h>
#include "Bob.h"

using namespace std;

long long Bob(vector<pair<int,int>> v) {
  int n = 5000;
  vector<vector<int>> g(n + 1);
  for (auto& p : v) {
    g[p.first].push_back(p.second);
    g[p.second].push_back(p.first);
  }
  long long res = 0;
  for (int i : g[1]) {
    if (i == 2) {
      continue;
    }
    int b = (i % 60);
    res |= (1LL << b);
  }
  return res;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1064 KB Correct.
2 Incorrect 2 ms 1068 KB Incorrect answer.
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1064 KB Correct.
2 Incorrect 2 ms 1068 KB Incorrect answer.
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1064 KB Correct.
2 Incorrect 2 ms 1068 KB Incorrect answer.
3 Halted 0 ms 0 KB -