#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <atcoder/all>
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
long long ka() {
long long x = 0;
bool z = false;
while (1)
{
char y = getchar();
if (y == '-')
z = true;
else if ('0' <= y && y <= '9')
x = x * 10 + y - '0';
else
{
if (z)
x *= -1;
return x;
}
}
}
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
} else if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void assignHints(int subtask, int N, int A[], int B[]);
void speedrun(int subtask, int N, int start);
void setHintLen(int l);
void setHint(int i, int j, bool b);
int getLength();
bool getHint(int j);
bool goTo(int x);
const int M = 1005;
vector<int> g[M];
bool a[M][M];
vector<int> get_rep(int cur) {
vector<int> indices;
for(int i = 0; i <= 9; i++) {
if(cur & (1 << i)) {
indices.push_back(i);
}
}
return indices;
}
void dfs_Len(int node, int parent) {
vector<int> child;
for(auto i: g[node]) {
if(i == parent) continue;
dfs_Len(i, node);
child.push_back(i);
}
if(!child.empty()) {
auto ind = get_rep(child[0]);
for(auto i: ind) {
setHint(node, 1 + i, true);
}
for(int i = 1; i < sz(child); i++) {
// child[i - 1], child[i]
ind = get_rep(child[i]);
for(auto j: ind) {
setHint(child[i - 1], 11 + j, true);
}
}
// int lst = child.back();
// ind = get_rep(node);
// for(auto j: ind) {
// setHint(lst, 11 + j, true);
// }
}
auto up = get_rep(parent);
for(auto i: up) {
setHint(node, 21 + i, true);
}
}
void assignHints(int subtask, int N, int A[], int B[]) { /* your solution here */
for(int i = 1; i < N; i++) {
a[A[i]][B[i]] = true;
a[B[i]][A[i]] = true;
//
g[A[i]].push_back(B[i]);
g[B[i]].push_back(A[i]);
}
setHintLen(30);
dfs_Len(1, 0);
}
vector<int> adj[M];
int h_rep(int st) {
if(st == 0) {
int answ = 0;
for(int i = 1; i <= 10; i++) {
int cur = getHint(i);
if(cur) {
answ |= (1 << (i - 1));
}
}
return answ;
} else if(st == 1) {
int answ = 0;
for(int i = 11; i <= 20; i++) {
int cur = getHint(i);
if(cur) {
answ |= (1 << (i - 11));
}
}
return answ;
} else {
int answ = 0;
for(int i = 21; i <= 30; i++) {
int cur = getHint(i);
if(cur) {
answ |= (1 << (i - 21));
}
}
return answ;
}
}
bool vis[M];
void dfs(int node, int parent) {
// demic gnum enq nerqev
int get_first_child = h_rep(0);
vis[node] = true;
int oki = 0;
if(get_first_child) {
goTo(get_first_child);
if(!vis[get_first_child]) {
dfs(get_first_child, node);
}
oki = 1;
}
int lst = get_first_child;
if(lst) {
while(true) {
int get_next = h_rep(1);
if(get_next && !vis[get_next]) {
goTo(node);
goTo(get_next);
dfs(get_next, node);
} else {
break;
}
}
}
if(!parent) {
if(oki) goTo(node);
int cc = h_rep(2);
if(cc && !vis[cc]) {
goTo(cc);
dfs(cc, 0);
}
}
}
void speedrun(int subtask, int N, int start) { /* your solution here */
int len = getLength();
dfs(start, 0);
}
Compilation message
speedrun.cpp: In function 'void speedrun(int, int, int)':
speedrun.cpp:252:7: warning: unused variable 'len' [-Wunused-variable]
252 | int len = getLength();
| ^~~
speedrun.cpp: In function 'void setIO(std::string)':
speedrun.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
speedrun.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
89 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
speedrun.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
91 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
speedrun.cpp:92:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
92 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
82 ms |
1708 KB |
Solution didn't visit every node |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
1360 KB |
The length is too large |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
1360 KB |
The length is too large |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
80 ms |
1764 KB |
Solution didn't visit every node |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
67 ms |
1744 KB |
Solution didn't visit every node |
| 2 |
Halted |
0 ms |
0 KB |
- |
