oj.uz

Submission #717198

# Submission time Handle Problem Language Result Execution time Memory
717198 2023-04-01T12:54:15 Z walterw Meetings (JOI19_meetings) C++17
100 / 100
 815 ms 3292 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
using pi = pair<int, int>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
 using lint = long long;

mt19937 rng(0x14004);
int randint(int lb, int ub){ return uniform_int_distribution<int>(lb, ub)(rng); }
 
void bridge(int x, int y){ Bridge(min(x, y), max(x, y)); }
 map<lint, int> mp;
int query(lint x, lint y, lint z){
    if(x > y) swap(x, y);
    if(y > z) swap(y, z);
    if(x > y) swap(x, y);
    lint qq = (x << 40) | (y << 20) | z;
    if(mp.find(qq) != mp.end()) return mp[qq];
    return mp[qq] = Query(x, y, z);
}

void dfs(vector<int> v){
	if(v.size() == 1) return;
	if(v.size() == 2){
		bridge(v[0], v[1]);
		return;
	}
    shuffle(v.begin()+1, v.end(), rng);
    vector<pi> ords;
  vector<int> fuck = {v[0]};
    ords.emplace_back(v[1], v[1]);
	for(int i=2; i<v.size(); i++){
		int q = query(v[0], v[1], v[i]);
      if(q == v[0]) fuck.push_back(v[i]);
		else ords.emplace_back(q, v[i]);
	}
	sort(ords.begin(), ords.end(), [&](pi a, pi b){
		if(a.first != b.first) return query(v[0], a.first, b.first) == a.first;
		return a.second < b.second;
	});
  if(sz(ords)) bridge(v[0], ords[0].first);
	for(int i = 0; i < sz(ords); ){
		int e = i;
      vector<int> w;
		while(e < sz(ords) && ords[i].first == ords[e].first){
			w.push_back(ords[e++].second);
		}
		swap(w[0], *find(all(w), ords[i].first));
		dfs(w);
		if(e < sz(ords)) bridge(ords[i].first, ords[e].first);
		i = e;
	}
  dfs(fuck);
}
 
void Solve(int N) {
	vector<int> v(N);
	iota(v.begin(), v.end(), 0);
	dfs(v);
}

Compilation message

meetings.cpp: In function 'void dfs(std::vector<int>)':
meetings.cpp:33:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for(int i=2; i<v.size(); i++){
      |               ~^~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 1444 KB Output is correct
2 Correct 281 ms 1444 KB Output is correct
3 Correct 391 ms 1472 KB Output is correct
4 Correct 393 ms 1560 KB Output is correct
5 Correct 222 ms 1172 KB Output is correct
6 Correct 226 ms 1388 KB Output is correct
7 Correct 403 ms 2248 KB Output is correct
8 Correct 466 ms 2648 KB Output is correct
9 Correct 484 ms 2892 KB Output is correct
10 Correct 422 ms 2740 KB Output is correct
11 Correct 593 ms 2996 KB Output is correct
12 Correct 394 ms 1464 KB Output is correct
13 Correct 203 ms 1140 KB Output is correct
14 Correct 309 ms 1808 KB Output is correct
15 Correct 280 ms 1732 KB Output is correct
16 Correct 365 ms 1904 KB Output is correct
17 Correct 619 ms 3292 KB Output is correct
18 Correct 383 ms 1692 KB Output is correct
19 Correct 326 ms 1616 KB Output is correct
20 Correct 346 ms 1824 KB Output is correct
21 Correct 329 ms 1776 KB Output is correct
22 Correct 350 ms 1836 KB Output is correct
23 Correct 351 ms 1880 KB Output is correct
24 Correct 348 ms 2004 KB Output is correct
25 Correct 440 ms 1796 KB Output is correct
26 Correct 392 ms 1852 KB Output is correct
27 Correct 443 ms 1628 KB Output is correct
28 Correct 603 ms 3104 KB Output is correct
29 Correct 385 ms 2784 KB Output is correct
30 Correct 413 ms 2740 KB Output is correct
31 Correct 427 ms 2928 KB Output is correct
32 Correct 781 ms 2360 KB Output is correct
33 Correct 815 ms 2332 KB Output is correct
34 Correct 6 ms 464 KB Output is correct
35 Correct 5 ms 464 KB Output is correct
36 Correct 5 ms 496 KB Output is correct
37 Correct 3 ms 464 KB Output is correct
38 Correct 3 ms 464 KB Output is correct
39 Correct 7 ms 464 KB Output is correct
40 Correct 9 ms 592 KB Output is correct
41 Correct 10 ms 684 KB Output is correct
42 Correct 13 ms 596 KB Output is correct
43 Correct 6 ms 464 KB Output is correct
44 Correct 10 ms 464 KB Output is correct
45 Correct 10 ms 520 KB Output is correct
46 Correct 8 ms 464 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 1 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct