Submission #958289

#TimeUsernameProblemLanguageResultExecution timeMemory
958289vjudge1Swapping Cities (APIO20_swap)C++14
0 / 100
0 ms440 KiB
#include<bits/stdc++.h> using namespace std ; #define maxn 250009 #define ll long long #define pb push_back #define fi first #define se second #define left id<<1 #define right id<<1|1 #define re exit(0); #define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 #define TIME (1.0*clock()/CLOCK_PERS_SEC) const int mod = 1e9+7 ; const int INF = 1e9 ; typedef vector<int> vi ; typedef pair<int,int> pii ; typedef vector<pii> vii ; void add ( int &a , int b ) { a += b ; if ( a >= mod ) a -= mod ; if ( a < 0 ) a += mod ; } template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ;} template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ;} void rf () { freopen("bai1.inp","r",stdin) ; } int _pow ( int a , int n ) { if ( n == 0 ) return 1 ; int res = _pow (a,n/2) ; if ( n % 2 ) return 1ll*res*res%mod*a%mod ; else return 1ll*res*res%mod ; } mt19937 rng(time(0)) ; //#include "grader.h" int n , m ; vi u , v , w ; int Max_w ; void init ( int N , int M , vi U , vi V , vi W ) { n = N , m = M , u = U , v = V , w = W ; for ( auto x : W ) chkmax (Max_w,x) ; } int getMinimumFuelCapacity ( int x , int y ) { if ( n == 2 ) return -1 ; return Max_w ; }

Compilation message (stderr)

swap.cpp: In function 'void rf()':
swap.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen("bai1.inp","r",stdin) ;
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...