Submission #120096

#TimeUsernameProblemLanguageResultExecution timeMemory
120096MvCWiring (IOI17_wiring)C++11
13 / 100
32 ms5496 KiB
#pragma GCC target("avx2") #pragma GCC optimization("O3") #pragma GCC optimization("unroll-loops") #include<bits/stdc++.h> #include "wiring.h" #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const ll nmax=1e5+50; const int mod=1e9+7; using namespace std; int n,m,i; ll r[nmax],b[nmax],rs; ll min_total_length(vector<int>R,vector<int>B) { n=R.size(),m=B.size(); for(i=1;i<=n;i++)r[i]=R[i-1]; for(i=1;i<=m;i++)b[i]=B[i-1]; for(i=1;i<=n;i++)rs+=r[n]-r[i]; for(i=1;i<=m;i++)rs+=b[i]-b[1]; rs+=max(n,m)*(b[1]-r[n]); return rs; } /*int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); return 0; }*/

Compilation message (stderr)

wiring.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
wiring.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
#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...