Submission #616909

#TimeUsernameProblemLanguageResultExecution timeMemory
616909ktkeremGame (IOI14_game)C++17
100 / 100
333 ms16360 KiB
/*#pragma GCC target ("avx2") #pragma GCC optimize ("O3") #pragma GCC optimize("Ofast") #pragma GCC optimize ("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/ #include<bits/stdc++.h> /*#include <bits/extc++.h> using namespace std; using namespace __gnu_pbds; template<class T> using oset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>; /**/ //typedef int ll; typedef long long ll; typedef unsigned long long ull; typedef __int128 vll; typedef unsigned __int128 uvll; ll _i=0; #define ffn(x) _i=x #define llll std::pair<ll , ll> #define stitr set<ll>::iterator #define fora(y,x) for(ll y=_i;x>y;y++) #define pb push_back #define pf push_front #define halo cout << "hello\n" #define fi first #define sec second #define all(a) a.begin() , a.end() const ll limit = 998244353; const ll ous = 2e5 + 7; const ll dx[4] = {1 , 0 , 0 , -1} , dy[4] = {0,1,-1,0}; ll f[ous]; void initialize(int n){ return; } int hasEdge(int u, int v){ ll mx = std::max(u , v); f[mx]++; if(f[mx] == mx){ return 1; } return 0; }

Compilation message (stderr)

game.cpp:12:1: warning: "/*" within comment [-Wcomment]
   12 | /**/
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...