oj.uz

Submission #551543

# Submission time Handle Problem Language Result Execution time Memory
551543 2022-04-21T03:01:27 Z krit3379 Rail (IOI14_rail) C++17
100 / 100
 89 ms 844 KB 
#include<bits/stdc++.h>
using namespace std;
#include"rail.h"
#define N 5005

struct A{
    int x,id;
    bool operator<(const A& o)const{
        return x<o.x;
    }
};

A l,r;
vector<A> v;
map<int,int> mp;

void findLocation(int n, int first, int location[], int stype[]){
    int i,pos;
    location[0]=first;
    stype[0]=1;
    if(n==1)return ;
    l={first,0};
    mp[l.x]=1;
    for(i=1;i<n;i++)v.push_back({getDistance(0,i),i});
    sort(v.begin(),v.end());
    r={l.x+v[0].x,v[0].id};
    location[v[0].id]=r.x;
    stype[v[0].id]=2;
    mp[r.x]=2;
    for(i=1;i<v.size();i++){
        int xl,xr;
        xl=getDistance(v[i].id,l.id);
        xr=getDistance(v[i].id,r.id);
        pos=l.x+xl;
        int val=(pos+r.x-xr)/2;
        if((mp.count(val)&&mp[val]==1)||(!mp.count(val)&&val>first)){
            A temp={pos,v[i].id};
            location[v[i].id]=pos;
            stype[v[i].id]=2;
            r=max(r,temp);
            mp[pos]=2;
            continue;
        }
        pos=r.x-xr;
        A temp={pos,v[i].id};
        location[v[i].id]=pos;
        stype[v[i].id]=1;
        l=min(l,temp);
        mp[pos]=1;
    }
    return ;
}

Compilation message

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:30:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<A>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(i=1;i<v.size();i++){
      |             ~^~~~~~~~~

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 384 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 388 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 380 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 380 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 388 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 380 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 #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 752 KB Output is correct
2 Correct 83 ms 764 KB Output is correct
3 Correct 86 ms 764 KB Output is correct
4 Correct 69 ms 716 KB Output is correct
5 Correct 69 ms 756 KB Output is correct
6 Correct 69 ms 752 KB Output is correct
7 Correct 78 ms 764 KB Output is correct
8 Correct 76 ms 752 KB Output is correct
9 Correct 89 ms 716 KB Output is correct
10 Correct 73 ms 844 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 752 KB Output is correct
2 Correct 78 ms 768 KB Output is correct
3 Correct 75 ms 716 KB Output is correct
4 Correct 75 ms 752 KB Output is correct
5 Correct 68 ms 752 KB Output is correct
6 Correct 70 ms 756 KB Output is correct
7 Correct 76 ms 716 KB Output is correct
8 Correct 77 ms 756 KB Output is correct
9 Correct 71 ms 752 KB Output is correct
10 Correct 74 ms 760 KB Output is correct
11 Correct 72 ms 764 KB Output is correct
12 Correct 72 ms 760 KB Output is correct
13 Correct 74 ms 752 KB Output is correct
14 Correct 78 ms 716 KB Output is correct
15 Correct 71 ms 716 KB Output is correct
16 Correct 74 ms 768 KB Output is correct
17 Correct 74 ms 716 KB Output is correct
18 Correct 75 ms 768 KB Output is correct
19 Correct 77 ms 772 KB Output is correct
20 Correct 74 ms 764 KB Output is correct