Submission #1201977

#TimeUsernameProblemLanguageResultExecution timeMemory
1201977M_SH_OEaster Eggs (info1cup17_eastereggs)C++20
6 / 100
0 ms440 KiB
#include <bits/stdc++.h> #include "grader.h" /*#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp>*/ #define ll long long #define ll1 long long #define ull unsigned long long #define dou long double #define str string #define vll vector<ll> #define vi vector<int> #define pll pair<ll, ll> #define vpll vector<pll> #define vbool vector<bool> #define vstr vector<str> #define vvll vector<vll> #define pb push_back #define pf push_front //#define endl "\n" #define fr first #define se second // #define sortcmp(a) sort(a.begin(), a.end(), cmp) #define sort(a) sort(a.begin(), a.end()) #define reverse(a) reverse(a.begin(), a.end()) #define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define INF 5000000000000000000 #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> using namespace std; //using namespace __gnu_pbds; mt19937 rng(time(0)); ll randll(ll l, ll r){ return uniform_int_distribution<ll>(l, r)(rng); } /*vbool us; vvll g; ll k1 = 0; ll x; void dfs(ll v, ll k, ll p = -1) { c.pb(v); if (!us[v]) k1 ++; if (k1 == k) return; for (int i : g[v]) { if (i == p) continue; dfs(i, k, v); if (k1 == k) return; } }*/ /*int query(vector < int > islands) { for (int i : islands) { if (i == x) return 1; } return 0; }*/ int findEgg(int n, vector < pair < int, int > > bridges) { for (int i = 1; i <= n; i ++) { vector<int> c; c.pb(i); if (query(c)) return i; } return 1; } /*int main() { ll n; cin >> n >> x; vector<pair<int, int>> v; for (int i = 0; i < n-1; i ++) { ll a, b; cin >> a >> b; v.pb({a, b}); } cout << findEgg(n, v) << endl; }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...