제출 #1006471

#제출 시각아이디문제언어결과실행 시간메모리
1006471christinelynn게임 (IOI14_game)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define ll int #define pb push_back #define pii pair<ll,ll> #define fi first #define sec second #define endl '\n' #define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag, tree_order_statistics_node_update> #define ordered_multiset tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> const ll MOD = 998244353; const ll N = 1505; const ll INF = 1e18; ll cnt[N]; ll n; void initialize(ll N){ N = n; } bool hasEdge(ll u, ll v){ if(max(cnt[u],cnt[v]) == n-1) return true; else{ cnt[u]++, cnt[v]++; return false; } } /* 6 5 4 3 2 1 0 */

컴파일 시 표준 에러 (stderr) 메시지

game.cpp:17:16: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   17 | const ll INF = 1e18;
      |                ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...