oj.uz

Submission #1015982

# Submission time Handle Problem Language Result Execution time Memory
1015982 2024-07-07T08:05:01 Z SulA Magic Show (APIO24_show) C++17
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
#include "Alice.h"
using namespace std;
 
vector<pair<int, int>> Alice() {
  long long x = setN(5000);
  vector<pair<int,int>> tree;
  for (int i = 1; i <= x; i++) {
    if (i != x) {
      tree.push_back({i, x});
    }
  }
  return tree;
}

#include <bits/stdc++.h>
#include "Bob.h"
using namespace std;
 
long long Bob(vector<pair<int,int>> tree) {
  int cnt[5001] = {};
  for (auto [u,v] : tree) {
    cnt[u]++, cnt[v]++;
  }
  return max_element(cnt, cnt+5001) - cnt;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -