Submission #791990

#TimeUsernameProblemLanguageResultExecution timeMemory
791990burythelightdeepwithinMeandian (CEOI06_meandian)C++14
0 / 100
10 ms208 KiB
#include <bits/stdc++.h> #include "libmean.h" using namespace std; const int N = 103; int ans[N], ans2[N]; int n; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); n = Init(); for (int i = 1; i <= (n-4); i++){ int tmp = 0, mx = 0, mn = INT_MAX; for (int j = i; j <= i+4; j++){ int q[5], ptr = 0; for (int k = i; k <= i+4; k++){ if (k == j){ continue; } ptr++; q[ptr] = k; } int w = Meandian(q[1], q[2], q[3], q[4]); tmp += w; mx = max(mx, w); mn = min(mn, w); } tmp -= (mx+mn); int f = tmp - (mx*2), t = tmp - (mn*2), s = tmp - f - t; for (int j = i; j <= i+4; j++){ int q[5], ptr = 0; for (int k = i; k <= i+4; k++){ if (k == j){ continue; } ptr++; q[ptr] = k; } int w = Meandian(q[1], q[2], q[3], q[4]); if (w == mx){ ans[j] = f; } else if (w == mn){ ans[j] = t; } else { ans[j] = s; } } } for (int i = 1; i <= n; i++){ if (ans[i] == 0){ ans[i] = -1; } ans2[i-1] = ans[i]; } Solution(ans2); }
#Verdict Execution timeMemoryGrader output
Fetching results...