제출 #1187331

#제출 시각아이디문제언어결과실행 시간메모리
1187331swishy123Stations (IOI20_stations)C++20
0 / 100
306 ms532 KiB
#include <iostream> #include <algorithm> #include <vector> #include <random> #include <chrono> #include <set> #include <map> #include <stack> #include <functional> #include <iomanip> #include <queue> #include <cassert> #include <complex> #include <cstring> #include <memory> #include <bitset> #include <sstream> #include <cmath> #include <numeric> #include <numbers> #include <fstream> #include "stations.h" using namespace std; #ifndef template #ifndef define #define ll long long #define ld long double #define pl pair<ll, ll> #define pi pair<int, int> #define nl cout << '\n'; #define x first #define y second #define cbit(x) __builtin_popcountll(x) #define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) #define siz(x) (int)x.size() #endif #ifndef print void print(size_t x) {cout << x << ' ';} void print(int x) {cout << x << ' ';} void print(long long x) {cout << x << ' ';} void print(float x) {cout << x << ' ';} void print(long double x) {cout << x << ' ';} void print(char x) {cout << x << ' ';} void print(const char* x) {cout << x << ' ';} void print(bool x) {cout << x << ' ';} void print(string &x) {cout << x << ' ';} template<typename T, typename V> void print(pair<T, V> &p) {print(p.x); print(p.y);} template<typename T> void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);} template<typename T> void print(vector<vector<T>> v) { for (int i = 0; i < v.size(); i++){ for (int j = 0; j < v[i].size(); j++) print(v[i][j]); nl; } } template <typename T, typename... V> void print(T t, V&&... v) {print(t); print(v...);} #endif #ifndef read void read(int &x) {cin >> x;} void read(long long &x) {cin >> x;} void read(unsigned &x) {cin >> x;} void read(unsigned long long &x) {cin >> x;} void read(float &x) {cin >> x;} void read(long double &x) {cin >> x;} void read(char &x) {cin >> x;} void read(string &x) {cin >> x;} void read(bool &x) {cin >> x;} template<typename T> void read(vector<T> &v) { for (int i = 0; i < v.size(); i++) read(v[i]); } template <typename T, typename... V> void read(T &t, V&... v) {read(t); read(v...);} #endif mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); template<class T> bool maxi(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template<class T> bool mini(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template<class... Args> auto vec(size_t n, Args&&... args) { if constexpr(sizeof...(args) == 1) return vector(n, args...); else return vector(n, vec(args...)); } #endif using namespace std; const ll inf = 1e18; const ll def = 1e5+1; const ll mod = 1e9+9; using namespace std; vector<int> label(int n, int k, vector<int> u, vector<int> v){ vector<vector<int>> edg(n); for (int i = 0; i < n - 1; i++){ edg[u[i]].push_back(v[i]); edg[v[i]].push_back(u[i]); } vector<int> order(n); int indx = 0; auto dfs = [&](int u, int pre, int h, auto&& dfs) -> void{ if (h % 2 == 0) order[u] = indx++; for (int v : edg[u]){ if (v == pre) continue; dfs(v, u, h + 1, dfs); } if (h % 2 == 1) order[u] = indx++; }; dfs(0, -1, 0, dfs); return order; } int find_next_station(int s, int t, vector<int> c){ bool flag = 0; for (int u : c){ if (u > s) flag = 1; } vector<pair<pi, int>> ranges; int parent = -1; if (!flag){ for (int i = 0; i < c.size(); i++){ if (i == 0) ranges.push_back({{s, c[i]}, c[i]}); else ranges.push_back({{c[i - 1] + 1, c[i]}, c[i]}); } if (s != 0){ ranges.pop_back(); parent = c.back(); } } else{ for (int i = 1; i < c.size(); i++){ if (i == c.size() - 1) ranges.push_back({{c[i], s}, c[i]}); else ranges.push_back({{c[i], c[i + 1] - 1}, c[i]}); } parent = c.front(); } for (int i = 0; i < ranges.size(); i++){ int u = ranges[i].y; auto [l, r] = ranges[i].x; if (t >= l && t <= r) return u; } return parent; } // static int max_label = 0; // static int r, n, k, q; // static std::vector<int> u, v, labels, answers; // static std::map<int, int> reverse_labels; // static std::vector<std::vector<int>> adjlist; // static int s, t, w; // static std::vector<int> c; // int main() { // ios_base::sync_with_stdio(0); // cin.tie(0); cout.tie(0); // if (ifstream("input.txt").good()){ // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); // } // assert(scanf("%d", &r) == 1); // for (int tc = 0; tc < r; tc++) { // assert(scanf("%d%d", &n, &k) == 2); // u.resize(n - 1); // v.resize(n - 1); // adjlist.clear(); // adjlist.resize(n); // for (int i = 0; i < n - 1; i++) { // assert(scanf("%d%d", &u[i], &v[i]) == 2); // adjlist[u[i]].push_back(v[i]); // adjlist[v[i]].push_back(u[i]); // } // labels = label(n, k, u, v); // if ((int)labels.size() != n) { // printf("Number of labels not equal to %d\n", n); // exit(0); // } // reverse_labels.clear(); // for (int i = 0; i < n; i++) { // if (labels[i] < 0 || labels[i] > k) { // printf("Label not in range 0 to %d\n", k); // exit(0); // } // if (reverse_labels.find(labels[i]) != reverse_labels.end()) { // printf("Labels not unique\n"); // exit(0); // } // reverse_labels[labels[i]] = i; // if (labels[i] > max_label) { // max_label = labels[i]; // } // } // assert(scanf("%d", &q) == 1); // for (int i = 0; i < q; i++) { // assert(scanf("%d%d%d", &s, &t, &w) == 3); // c.clear(); // for (int v : adjlist[s]) { // c.push_back(labels[v]); // } // std::sort(c.begin(), c.end()); // int answer = find_next_station(labels[s], labels[t], c); // if (!std::binary_search(c.begin(), c.end(), answer)) { // printf("Label %d returned by find_next_station not found in c\n", answer); // exit(0); // } // answers.push_back(reverse_labels[answer]); // } // } // printf("%d\n", max_label); // for (int index : answers) { // printf("%d\n", index); // } // exit(0); // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...