# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35111 | imeimi2000 | Towns (IOI15_towns) | C++14 | 36 ms | 1220 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towns.h"
#include <vector>
#include <algorithm>
using namespace std;
int n;
int d0[110];
int d1[110];
int dist[110];
bool checkSame(int i, int j) {
return (getDistance(i, j) != dist[i] + dist[j]);
}
bool chk[110];
bool check(int p) {
int l = 0, r = 0;
vector<int> vt;
for (int i = 0; i < n; ++i) {
if (d1[i] - dist[i] < p) ++l;
else if (d1[i] - dist[i] > p) ++r;
else vt.push_back(i);
}
if (vt.empty() || l > n / 2 || r > n / 2) return false;
int st, sum = 0;
vector<int> gr;
for (int i = 0; i < vt.size(); ++i) {
if (sum == 0) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |