Submission #787688

#TimeUsernameProblemLanguageResultExecution timeMemory
787688aymanrsCyberland (APIO23_cyberland)C++17
0 / 100
18 ms2248 KiB
#include <bits/stdc++.h> using namespace std; double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){ vector<int> kp; bool use[N] = {false}; for(int i = H-1;i;i--) if(arr[i] == 2) kp.push_back(i); for(int i = 0;i < min(int(kp.size()), K);i++) use[kp[i]] = true; long double ans = 0; for(int i = 0;i < H;i++){ if(!arr[i]) ans = 0; else if(use[i]) ans /= 2; ans += c[i]; } return ans; } // int main(){ // cout << solve(6, 5, 2, 5, {0, 1, 2, 3, 4}, {1, 2, 3, 4, 5}, {1, 2, 4, 8, 16}, {1, 2, 0, 2, 2, 1}) << '\n'; // }
#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...