oj.uz

Submission #201434

# Submission time Handle Problem Language Result Execution time Memory
201434 2020-02-10T14:50:16 Z dimash241 Meetings (JOI19_meetings) C++17
100 / 100
 1203 ms 1068 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
 
//# include <x86intrin.h>
#include "meetings.h"
 
# include <bits/stdc++.h>
 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}
 
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
vector < int > g[2020];
int e[2020][2020];
int deg[2020];
int u[2020];

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	 
 
void Bridge (int, int);
int Query (int, int, int);
int opera = 0;
map < pair < int, int > , int > was;
 
void PrintOut(int a, int b) {
	if (a > b) swap(a, b);
	opera++;
	if (opera == n) {
		assert(0);
	}
//	cerr << ' ' << a << ' ' << b << ' ' << opera << '\n';
//	if (opera == 1) exit(0);
	Bridge(a, b);
}
 
void reduce (vector < int > &v) {
	sort(every(v));
	v.resize(unique(every(v)) - v.begin());
	random_shuffle(every(v));
}

void go (int v) {
	if (g[v].empty()) return;
//	reduce(g[v]);
	vector < int > cur;
	cur.swap(g[v]);

	int len = cur.size();
	int y = cur[rng() % len];
	int x = v; 
	set < int > s;
	s.insert(v);
	s.insert(y);
	for (int z : cur) if (z != y) {
	//	cout << x << ' ' << y << ' ' << z << '\n';
		int t = Query(x, y, z);
		s.insert(t);

		if (t != z) g[t].pb(z);
	}
	//exit(0);
	vector < int > ord(s.begin(), s.end());
//	for (auto it : ord) cout << it << ' ';
//	exit(0);
	sort(every(ord), [&](int y, int z) { 
		return (x == y) || ((x != z) && Query(x, y, z) == y); 
	} );

//	cout << sz(ord);
//	exit(0);

	for (int i = 1; i < sz(ord); ++i) {
		PrintOut(ord[i-1], ord[i]);
	}
	for (auto it : ord)
		go(it);
}
 
 
void Solve(int N) {
	n = N;
	opera = 0;
	for (int i = 1; i < n; ++i)
		g[0].pb(i);
	go(0);
}
 
/* 
namespace {
 
const int MAX_N = 2000;
const int MAX_CALLS = 100000;
 
void WrongAnswer(int code) {
  printf("Wrong Answer [%d]\n", code);
  exit(0);
}
 
int N, num_calls;
std::vector<int> graph[MAX_N];
std::set<std::pair<int, int>> edges, edges_reported;
 
int weight[MAX_N];
 
bool Visit(int p, int e, int rt = -1) {
  if (p == e) {
    ++weight[p];
    return true;
  }
  for (int q : graph[p]) {
    if (q != rt) {
      if (Visit(q, e, p)) {
        ++weight[p];
        return true;
      }
    }
  }
  return false;
}
 
}  // namespace
 
int Query(int u, int v, int w) {
  if (!(0 <= u && u <= N - 1 && 0 <= v && v <= N - 1 && 0 <= w && w <= N - 1 &&
        u != v && u != w && v != w)) {
    WrongAnswer(1);
  }
  if (++num_calls > MAX_CALLS) {
    WrongAnswer(2);
  }
  std::fill(weight, weight + N, 0);
  Visit(u, v);
  Visit(u, w);
  Visit(v, w);
  for (int x = 0; x < N; ++x) {
    if (weight[x] == 3) {
      return x;
    }
  }

  printf("Error: the input may be invalid\n");
  exit(0);
}
 
void Bridge(int u, int v) {
  if (!(0 <= u && u < v && v <= N - 1)) {
    WrongAnswer(3);
  }
  if (!(edges.count(std::make_pair(u, v)) >= 1)) {
    WrongAnswer(4);
  }
  if (!(edges_reported.count(std::make_pair(u, v)) == 0)) {
    WrongAnswer(5);
  }
  edges_reported.insert(std::make_pair(u, v));
}
 
int main() {
  if (scanf("%d", &N) != 1) {
    fprintf(stderr, "Error while reading input\n");
    exit(1);
  }
  for (int i = 0; i < N - 1; ++i) {
    int u, v;
    if (scanf("%d%d", &u, &v) != 2) {
      fprintf(stderr, "Error while reading input\n");
      exit(1);
    }
    graph[u].push_back(v);
    graph[v].push_back(u);
    edges.insert(std::make_pair(u, v));
  }
 
  num_calls = 0;
  Solve(N);
  if (edges_reported.size() != static_cast<size_t>(N - 1)) {
    WrongAnswer(6);
  }
  printf("Accepted: %d\n", num_calls);
  return 0;
}
 
// B...a   */

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 372 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 372 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 372 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 380 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 11 ms 504 KB Output is correct
28 Correct 10 ms 376 KB Output is correct
29 Correct 11 ms 376 KB Output is correct
30 Correct 11 ms 632 KB Output is correct
31 Correct 9 ms 376 KB Output is correct
32 Correct 13 ms 504 KB Output is correct
33 Correct 17 ms 504 KB Output is correct
34 Correct 20 ms 376 KB Output is correct
35 Correct 19 ms 376 KB Output is correct
36 Correct 10 ms 508 KB Output is correct
37 Correct 19 ms 504 KB Output is correct
38 Correct 16 ms 376 KB Output is correct
39 Correct 14 ms 376 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 736 KB Output is correct
2 Correct 556 ms 636 KB Output is correct
3 Correct 572 ms 760 KB Output is correct
4 Correct 656 ms 760 KB Output is correct
5 Correct 429 ms 768 KB Output is correct
6 Correct 394 ms 1020 KB Output is correct
7 Correct 763 ms 832 KB Output is correct
8 Correct 828 ms 760 KB Output is correct
9 Correct 704 ms 632 KB Output is correct
10 Correct 743 ms 1068 KB Output is correct
11 Correct 952 ms 888 KB Output is correct
12 Correct 515 ms 760 KB Output is correct
13 Correct 423 ms 760 KB Output is correct
14 Correct 513 ms 632 KB Output is correct
15 Correct 513 ms 944 KB Output is correct
16 Correct 554 ms 764 KB Output is correct
17 Correct 799 ms 888 KB Output is correct
18 Correct 516 ms 888 KB Output is correct
19 Correct 467 ms 776 KB Output is correct
20 Correct 720 ms 888 KB Output is correct
21 Correct 699 ms 780 KB Output is correct
22 Correct 639 ms 772 KB Output is correct
23 Correct 555 ms 852 KB Output is correct
24 Correct 538 ms 760 KB Output is correct
25 Correct 716 ms 892 KB Output is correct
26 Correct 547 ms 764 KB Output is correct
27 Correct 596 ms 920 KB Output is correct
28 Correct 921 ms 888 KB Output is correct
29 Correct 708 ms 988 KB Output is correct
30 Correct 760 ms 804 KB Output is correct
31 Correct 834 ms 888 KB Output is correct
32 Correct 1203 ms 1056 KB Output is correct
33 Correct 894 ms 1016 KB Output is correct
34 Correct 10 ms 376 KB Output is correct
35 Correct 10 ms 376 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 11 ms 376 KB Output is correct
38 Correct 10 ms 508 KB Output is correct
39 Correct 15 ms 508 KB Output is correct
40 Correct 18 ms 376 KB Output is correct
41 Correct 21 ms 376 KB Output is correct
42 Correct 21 ms 376 KB Output is correct
43 Correct 10 ms 376 KB Output is correct
44 Correct 17 ms 504 KB Output is correct
45 Correct 15 ms 376 KB Output is correct
46 Correct 15 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 380 KB Output is correct
54 Correct 5 ms 380 KB Output is correct
55 Correct 5 ms 504 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 504 KB Output is correct
58 Correct 5 ms 504 KB Output is correct
59 Correct 5 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 5 ms 376 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 5 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 5 ms 376 KB Output is correct
66 Correct 5 ms 376 KB Output is correct
67 Correct 5 ms 504 KB Output is correct
68 Correct 5 ms 376 KB Output is correct
69 Correct 5 ms 376 KB Output is correct
70 Correct 5 ms 376 KB Output is correct
71 Correct 5 ms 376 KB Output is correct
72 Correct 5 ms 504 KB Output is correct