Submission #1276181

#TimeUsernameProblemLanguageResultExecution timeMemory
1276181KindaGoodGamesHoliday (IOI14_holiday)C++20
7 / 100
5092 ms796 KiB
#include"holiday.h" #include<bits/stdc++.h> using namespace std; #define int long long long long findMaxAttraction(int32_t n, int32_t s, int32_t d, int32_t arr[]) { int p2 = 1 << n; int ma = 0; for(int m = 0; m < p2; m++){ int l = s; int r = s; int cnt = 0; int val = 0; for(int i = 0; i < n; i++){ if(m & (1 << i)){ l = min(l,i); r = max(r,i); val += arr[i]; cnt++; } } int cost = (s-l) + (r-s) + min((s-l),(r-s)) + cnt; if(cost <= d){ ma = max(ma, val); } } return ma; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...