Submission #163385

#	Time	Username	Problem	Language	Result	Execution time	Memory
163385		davitmarg	Rail (IOI14_rail)	C++17	0 / 100	84 ms	584 KiB

rail

/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

#ifndef death
#include "rail.h"
#endif

#ifdef death
int getDistance(int a, int b)
{
    cout << a << " : " << b << endl;
    cin >> a;
    return a;
}
#endif

void findLocation(int n, int POS, int location[], int stype[])
{
    vector<pair<int, int>> x;
    vector<pair<int, int>> R, L;
    for (int i = 0; i < n; i++)
    {
        int d = getDistance(0, i);
        x.PB(MP(i, d));
    }
    sort(all(x));
    R.PB(x[0]);
    for (int i = 1; i < n; i++)
    {
        int d = getDistance(R.back().first, x[i].first);
        if (d == x[i].second + R.back().second - 1)
            R.PB(x[i]);
        else
            L.PB(x[i]);
    }
    for (int i = 0; i < R.size(); i++)
        location[R[i].first] = POS + R[i].second;

    for (int i = 0; i < L.size(); i++)
    {
        int d = R[i].second;
        location[L[i].first] = POS - (L[i].second - d - d + 1);
    }
}

#ifdef death

int main()
{
    return 0;
}

#endif

/*
 
 
 
*/

Compilation message (stderr)

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:57:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < R.size(); i++)
                     ~~^~~~~~~~~~
rail.cpp:60:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < L.size(); i++)
                     ~~^~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44