# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17289 | ainta | Towns (IOI15_towns) | C++98 | 25 ms | 1148 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<algorithm>
using namespace std;
#define pii pair<int,int>
#define X first
#define Y second
#define N_ 120
#define INF 999999999
int D1[N_], D2[N_], ddis, n, p1, p2;
pii w[15][N_];
bool chk[15][N_];
int v[N_], ckk;
bool Same(int a, int b){
int d = getDistance(a,b);
if(d!=D2[a]+D2[b]-ddis*2)return true;
return false;
}
pii Do(int pv, int cnt){
int i, cc = 0, t;
if(cnt == 1)return w[pv][0];
for(i=0;i<cnt/2;i++){
chk[pv][i]=false;
if(Same(w[pv][i*2].X,w[pv][i*2+1].X)){
w[pv+1][cc] = w[pv][i*2];
w[pv+1][cc].Y += w[pv][i*2+1].Y;
cc++;
# | 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... |