Submission #1108830

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1108830	2024-11-05 09:49:34	siewjh	Keys (IOI21_keys)	C++17	100 / 100	1633 ms	73648 KiB

keys

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
int keya[MAXN], p[MAXN], minv;
bool dead[MAXN];
vector<pair<int, int>> adj[MAXN];
set<int> ansl, recj;
int root(int x){
  if (p[x] == -1) return x;
  else return p[x] = root(p[x]);
}
void join(int ra, int rb){
  p[ra] = rb;
}
void search(int st){
  queue<int> q; map<int, vector<int>> lckm; set<int> ks, pro;
  q.push(st);
  while (!q.empty()){
    int x = q.front(); q.pop();
    int rx = root(x);
    if (rx == st){
      if (pro.count(x)) continue;
      pro.insert(x);
      if (!ks.count(keya[x])){
        ks.insert(keya[x]);
        for (int nn : lckm[keya[x]]) q.push(nn);
        lckm.erase(keya[x]);
      }
      for (auto [nn, nt] : adj[x]){
        if (ks.count(nt)) q.push(nn);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

keys.cpp: In function 'void search(int)':
keys.cpp:41:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |  if (pro.size() < minv){
      |      ~~~~~~~~~~~^~~~~~
keys.cpp:46:22: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |  else if (pro.size() == minv){
      |           ~~~~~~~~~~~^~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 17 / 17
• Subtask 4: 30 / 30
• Subtask 5: 33 / 33