oj.uz

Submission #962117

# Submission time Handle Problem Language Result Execution time Memory
962117 2024-04-13T07:12:10 Z IUA_Hasin Rail (IOI14_rail) C++17
30 / 100
 57 ms 612 KB 
#include "rail.h"
#include <bits/stdc++.h>
 
#define endl                                "\n"
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define ll                                  long long
 
using namespace std;

const ll M = 5001;
ll vis[M];

void findLocation(int N, int first, int location[], int stype[])
{
    location[0] = first;
    stype[0] = 1;
    vector<pair<ll, ll>> v;
    for(int i=1; i<N; i++){
        ll a = getDistance(0, i);
        v.push_back({a, i});
    }
    
    ll mn = v[0].first;
    ll mnind = v[0].second;
    for(int i=0; i<v.size(); i++){
        ll a = v[i].first;
        ll b = v[i].second;
        // cout << a << " " << b << endl;
        if(a<mn){
            mn = a;
            mnind = b;
        }
    }
    // cout<<endl;

    // cout << mn << " " << mnind << endl;
    // cout<<endl;

    location[mnind] = first+mn;
    stype[mnind] = 2;

    for(int i=1; i<N; i++){
        if(i!=mnind){
            ll a = getDistance(0, i);
            ll b = getDistance(mnind, i);
            // cout << a << " " << b << endl;
            if((mn+b)==a){
                stype[i] = 1;
                location[i] = location[mnind]-b;
            } else {
                stype[i] = 2;
                location[i] = location[0]+a;
            }
        }
    }
    // cout<<endl; 

    // for(int i=0; i<N; i++){
    //     cout << stype[i] << " " << location[i] << endl;
    // }


}

Compilation message

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

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 44.0

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