#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <limits.h>
#include <math.h>
#include <time.h>
#include <iostream>
#include <functional>
#include <numeric>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <map>
#include <set>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
#include "libmean.h"
int n, arr[100];
deque<int> Q;
void resolve(int a, int b, int c, int d, int e){
vector<pi> v;
v.emplace_back(Meandian(a, b, c, d), e);
v.emplace_back(Meandian(a, b, c, e), d);
v.emplace_back(Meandian(a, b, d, e), c);
v.emplace_back(Meandian(a, c, d, e), b);
v.emplace_back(Meandian(b, c, d, e), a);
sort(v.begin(), v.end());
int sum = 0;
for(int i=1; i<4; i++){
sum += v[i].first;
}
sum /= 2;
arr[v[2].second] = sum - v[2].first;
}
int main(){
n = Init();
memset(arr, -1, sizeof(arr));
for(int i=0; i<n; i++){
Q.push_back(i);
}
while(Q.size() >= 5){
resolve(Q[0], Q[1], Q[2], Q[3], Q[4]);
vector<int> tmp;
for(int i=0; i<5; i++){
if(arr[Q.front()] == -1) tmp.push_back(Q.front());
Q.pop_front();
}
for(auto &i : tmp){
Q.push_back(i);
}
}
Solution(arr);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
248 KB |
arguments must be between 1 and N |
| 2 |
Incorrect |
2 ms |
376 KB |
arguments must be between 1 and N |
| 3 |
Incorrect |
2 ms |
248 KB |
arguments must be between 1 and N |
| 4 |
Incorrect |
2 ms |
376 KB |
arguments must be between 1 and N |
| 5 |
Incorrect |
2 ms |
248 KB |
arguments must be between 1 and N |
| 6 |
Incorrect |
2 ms |
248 KB |
arguments must be between 1 and N |
| 7 |
Incorrect |
2 ms |
248 KB |
arguments must be between 1 and N |
| 8 |
Incorrect |
2 ms |
376 KB |
arguments must be between 1 and N |
| 9 |
Incorrect |
10 ms |
376 KB |
arguments must be between 1 and N |
| 10 |
Incorrect |
2 ms |
376 KB |
arguments must be between 1 and N |
