oj.uz

답안 #931003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931003 2024-02-21T04:13:49 Z vjudge1 철로 (IOI14_rail) C++17
30 / 100
 47 ms 4744 KB 
#include<bits/stdc++.h>

#include "rail.h"

using namespace std;

#define F first
#define S second
#define ll long long
#define maksim gay
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back

const int MAX=2e6+10;
const int inf=2e9;
const int N=2e5;
const int mod=998244353;

int d[MAX];
int use[MAX];
int d1[MAX];
int d2[MAX];

void findLocation(int n, int first, int location[], int stype[])
{
  int fin=-1;
  int st=0;
  for(int i=0;i<n;i++){
    stype[i]=0;
    if(i==st)continue;
    d[i]=getDistance(st,i);
    if(fin==-1||d[fin]>d[i])fin=i;
  }
  location[0]=first;
  stype[0]=1;
  if(n==1)return;
  for(int i=0;i<n;i++){
    if(i==fin)continue;
    d1[i]=getDistance(fin,i);
  }
  location[fin]=first+d[fin];
  stype[fin]=2;
  vector<pii> vec,vec1;
  for(int i=0;i<n;i++){
    if(i==st||i==fin)continue;
    if(d[i]==d[fin]+d1[i]){
      vec.pb({d[i],i});
    }
    else{
      vec1.pb({d1[i],i});
    }
  }
  sort(all(vec));
  int last=st;
  vector<pii> Op;
  Op.pb({location[st],st});
  for(auto [ff,v]:vec){
    int dd=getDistance(v,fin);
    if(dd==d1[v]){
      stype[v]=1;
      location[v]=location[fin]-d1[v];
      if(location[v]<=location[st])Op.pb({location[v],v});
    }
    else{
      stype[v]=2;
      for(int i=1;i<sz(Op);i++){
        int pos=dd-d1[Op[i].S];
        int f=location[Op[i].S]+pos;
        if(pos>=0&&f<Op[i-1].F){
          location[v]=f;
          break;
        }
      }
    }
  }
  Op.clear();
  Op.pb({location[fin],fin});
  sort(all(vec1));
  for(auto [ff,v]:vec1){
    int dd=getDistance(v,st);
    if(dd==d[v]){
      stype[v]=2;
      location[v]=location[st]+d[v];
      if(location[v]>=location[fin])Op.pb({location[v],v});
    }
    else{
      stype[v]=1;
      for(int i=1;i<sz(Op);i++){
        int pos=dd-d[Op[i].S];
        int f=location[v]-pos;
        if(pos>=0&&f>Op[i-1].F){
          location[v]=f;
          break;
        }
      }
    }
  }
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:63:7: warning: unused variable 'last' [-Wunused-variable]
   63 |   int last=st;
      |       ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4620 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 4744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 46 ms 4616 KB Output isn't correct
2 Halted 0 ms 0 KB -