Submission #466439

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
466439	2021-08-19 09:36:55	prvocislo	Chameleon's Love (JOI20_chameleon)	C++17	40 / 100	32 ms	668 KiB

chameleon

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 "chameleon.h"
#include <vector>
#include <iostream>
using namespace std;
const int maxn = 505;
vector<int> g[maxn * 2];
vector<pair<int, int>> v;
bool vis[maxn * 2];
int query(int x, vector<int> a)
{
  a.push_back(x);
  return Query(a);
}
void find_edges(int x, const vector<int> &a)
{
  if (!a.size()) return;
  if (a.size() == 1)
  {
    //cout << x << " " << a[0] << "\n";
    if (query(x, a) == 1) g[x].push_back(a[0]), g[a[0]].push_back(x);
    return;
  }
  vector<int> a1(a.begin(), a.begin() + a.size() / 2), a2(a.begin() + a.size() / 2, a.end());
  int c1 = query(x, a1), c2 = query(x, a2);
  if (c1 < a1.size() + 1) find_edges(x, a1);
  if (c2 < a2.size() + 1) find_edges(x, a2);
}
void dfs(int u, int c, vector<vector<int> >& k)
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

chameleon.cpp: In function 'void find_edges(int, const std::vector<int>&)':
chameleon.cpp:26:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |  if (c1 < a1.size() + 1) find_edges(x, a1);
      |      ~~~^~~~~~~~~~~~~~~
chameleon.cpp:27:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |  if (c2 < a2.size() + 1) find_edges(x, a2);
      |      ~~~^~~~~~~~~~~~~~~
chameleon.cpp: In function 'void rmv(int, int)':
chameleon.cpp:36:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for (int i = 0; i < g[a].size(); i++) if (g[a][i] == b)
      |                  ~~^~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36