oj.uz

Submission #966260

# Submission time Handle Problem Language Result Execution time Memory
966260 2024-04-19T15:33:46 Z AdamGS Rail (IOI14_rail) C++17
30 / 100
 46 ms 604 KB 
#include "rail.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int INF=1e9+7;
void findLocation(int n, int first, int location[], int stype[]) {
  location[0]=first;
  rep(i, n) stype[i]=1;
  if(n==1) return;
  vector<int>A(n);
  for(int i=1; i<n; ++i) A[i]=getDistance(0, i);
  pair<int,int>mi={A[1], 1};
  for(int i=1; i<n; ++i) mi=min(mi, {A[i], i});
  int x=mi.nd;
  stype[x]=2;
  location[x]=location[0]+mi.st;
  vector<int>B(n);
  rep(i, n) if(i!=x) B[i]=getDistance(x, i);
  vector<pair<int,int>>lewo, prawo;
  for(int i=1; i<n; ++i) if(i!=x) {
    if(max(A[i], B[i])<2*mi.st) location[i]=location[x]-B[i];
    else if(A[i]<B[i]) prawo.pb({A[i], i});
    else lewo.pb({B[i], i});
  }
  sort(all(prawo));
  sort(all(lewo));
  int lst=x;
  for(auto i : prawo) {
    int a=getDistance(lst, i.nd);
    if(a==i.st-A[lst]) location[i.nd]=location[lst]-a;
    else {
      location[i.nd]=location[0]+i.st;
      lst=i.nd;
      stype[i.nd]=2;
    }
  }
  lst=0;
  for(auto i : lewo) {
    int a=getDistance(lst, i.nd);
    if(a==i.st-B[lst]) {
      location[i.nd]=location[lst]+a;
      stype[i.nd]=2;
    } else {
      location[i.nd]=location[x]-i.st;
      lst=i.nd;
    }
  }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -