Submission #1156060

#TimeUsernameProblemLanguageResultExecution timeMemory
1156060nickolasarapidisNile (IOI24_nile)C++20
0 / 100
18 ms3908 KiB
#include "nile.h" #include <bits/stdc++.h> using namespace std; #define ll long long long N, Q; vector<ll> solve1(vector<int> W, vector<int> A, vector<int> B, vector<int> E){ ll ans = 0; for(long i = 0; i < N; i++){ ans += B[i]; } if(N%2 == 0){ return vector<ll>(Q, ans); } else{ long m = 1000000007; long x; for(long i = 0; i < N; i++){ if(A[i] < m){ m = A[i]; x = i; } } ans -= B[x]; ans += A[x]; return vector<ll>(Q, ans); } } vector<ll> solve2(vector<int> W, vector<int> A, vector<int> B, vector<int> E){ return vector<ll>(Q, (ll)0); } vector<ll> solve3(vector<int> W, vector<int> A, vector<int> B, vector<int> E){ return vector<ll>(Q, (ll)0); } vector<ll> solve(vector<int> W, vector<int> A, vector<int> B, vector<int> E){ return vector<ll>(Q, (ll)0); } vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){ N = W.size(); Q = E.size(); bool sub1 = true, sub2 = true, sub3 = true; for(long i = 0; i < N; i++){ if(W[i] != 1) sub1 = false; if(W[i] != i + 1) sub2 = false; if(A[i] != 2 or B[i] != 1) sub3 = false; } if(sub1) return solve1(W, A, B, E); else if(sub2) return solve2(W, A, B, E); else if(sub3) return solve3(W, A, B, E); else return solve(W, A, B, E); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...