oj.uz

Submission #798655

# Submission time Handle Problem Language Result Execution time Memory
798655 2023-07-30T22:29:09 Z TimDee Rail (IOI14_rail) C++17
100 / 100
 116 ms 764 KB 
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back

#define pi pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
int ask(int i, int j) {
  return getDistance(i,j);
}
void findLocation(int n, int p, int ans[], int type[]) {

  if (n==1) {
    ans[0]=p, type[0]=1; return;
  }
  
  vector<int> a(n), b(n), c(n);
  vector<int> vis(n,0); vis[0]=1;
  int f=0,s=1;
  forn(i,n) {
    if (vis[i]) continue;
    a[i]=ask(0,i);
    if (a[i] < a[s]) s=i;
  }
  vis[s]=1;
  b[0]=a[s];
  forn(i,n) {
    if (vis[i]) continue;
    b[i]=ask(s,i);
    if (b[i]<b[f]) f=i;
  }
  vis[f]=1;

  ans[0]=p, type[0]=1;
  ans[s]=p+a[s], type[s]=2;
  ans[f]=ans[s]-b[f], type[f]=1;

  vector<pi> l,r;

  c[0]=a[f], c[s]=b[f];
  forn(i,n) {
    if (vis[i]) continue;
    int x=a[i], y=b[i], z=b[f];
    if (x==a[s]+y) {
      l.pb({y,i});
      c[i]=y+z;
    } else if (y==x-a[s]+2*z) {
      r.pb({y-z,i});
      c[i]=y-z;
    } else assert(0);
  }
  
  sort(all(r));
  sort(all(l));

  int u,v;

  u=f, v=s;
  for(auto&it:r) {
    int d=it.f, i=it.s;
    int x=d, y=ask(v,i);
    int m=v;
    forn(j,n) {
      if (!vis[j]) continue;
      if (type[j]!=2) continue;
      if (ans[j] < ans[v]-y) continue;
      if (ans[j] < ans[m]) m=j;
    }
    if (x == ans[m]-ans[u]+ans[m]-(ans[v]-y)) {
      type[i]=1;
      ans[i]=ans[v]-y;
    } else {
      type[i]=2;
      ans[i]=ans[u]+x;
      v=i;
    }
    vis[i]=1;
  }

  u=f,v=s;
  for(auto&it:l) {
    int d=it.f, i=it.s;
    int x=d, y=ask(u,i);
    int m=u;
    forn(j,n) {
      if (!vis[j]) continue;
      if (type[j]!=1) continue;
      if (ans[j] > ans[u]+y) continue;
      if (ans[j] > ans[m]) m=j;
    }
    if (x == ans[v]-ans[m]+(ans[u]+y)-ans[m]) {
      type[i]=2;
      ans[i]=ans[u]+y;
    } else {
      type[i]=1;
      ans[i]=ans[v]-x;
      u=i;
    }
    vis[i]=1;
  }

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 388 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 392 KB Output is correct
9 Correct 1 ms 380 KB Output is correct
10 Correct 0 ms 384 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 644 KB Output is correct
2 Correct 110 ms 644 KB Output is correct
3 Correct 111 ms 628 KB Output is correct
4 Correct 112 ms 660 KB Output is correct
5 Correct 111 ms 588 KB Output is correct
6 Correct 114 ms 684 KB Output is correct
7 Correct 112 ms 640 KB Output is correct
8 Correct 110 ms 664 KB Output is correct
9 Correct 111 ms 628 KB Output is correct
10 Correct 111 ms 624 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 716 KB Output is correct
2 Correct 109 ms 656 KB Output is correct
3 Correct 110 ms 664 KB Output is correct
4 Correct 111 ms 660 KB Output is correct
5 Correct 112 ms 640 KB Output is correct
6 Correct 116 ms 628 KB Output is correct
7 Correct 111 ms 588 KB Output is correct
8 Correct 110 ms 628 KB Output is correct
9 Correct 111 ms 664 KB Output is correct
10 Correct 113 ms 764 KB Output is correct
11 Correct 110 ms 640 KB Output is correct
12 Correct 111 ms 588 KB Output is correct
13 Correct 109 ms 660 KB Output is correct
14 Correct 108 ms 628 KB Output is correct
15 Correct 112 ms 716 KB Output is correct
16 Correct 109 ms 588 KB Output is correct
17 Correct 112 ms 684 KB Output is correct
18 Correct 108 ms 628 KB Output is correct
19 Correct 110 ms 652 KB Output is correct
20 Correct 116 ms 640 KB Output is correct