제출 #843826

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843826		ogkostya	추월 (IOI23_overtaking)	C++17	39 / 100	3554 ms	16836 KiB

overtaking

#include "overtaking.h"
#include <algorithm>
#include <utility>

std::vector<std::vector<std::pair<long long, long long>>> SS(1001, std::vector<std::pair<long long, long long>>());


struct less_than_int
{
    inline bool operator() (const std::pair<long long, int>& a, const std::pair<long long, int>& b)
    {
        return (a.first < b.first);
    }
};

void sortVecPair(std::vector<long long>& vecA, std::vector<int>& vecB)
{
    std::vector<std::pair<long long, int>> vecC;
    vecC.reserve(vecA.size());
    for (int i = 0; i < vecA.size(); i++)
    {
        vecC.push_back(std::make_pair(vecA[i], vecB[i]));
    }

    std::sort(vecC.begin(), vecC.end(), less_than_int());

    vecA.clear();
    vecB.clear();
    vecA.reserve(vecC.size());
    vecB.reserve(vecC.size());
    for (int i = 0; i < vecC.size(); i++)
    {
        vecA.push_back(vecC[i].first);
        vecB.push_back(vecC[i].second);
    }
}

int _M;
std::vector<int> _S;
int _X;

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    _X = X;
    _M = M;
    _S = S;

    sortVecPair(T, W);

	for (int i = 0; i < N; i++)
	{
        //if (W[i] > X)
        ///    continue;

        long long a = T[i];
        for (int j = 1; j < M; j++)
        {
            long long b = a + 1LL * (_S[j] - _S[j - 1]) * W[i];

            for (int k = 0; k < SS[j].size(); k++)
            {
                if (SS[j][k].first < a && SS[j][k].second > b)
                    b = SS[j][k].second;
            }
            SS[j].push_back(std::make_pair(a, b));

            a = b;
        }
	}


    return;
}

long long arrival_time(long long Y)
{
    long long a = Y;
    for (int j = 1; j < _M; j++)
    {
        long long b = a + 1LL * (_S[j]-_S[j-1]) * _X;

        for (int k = 0; k < SS[j].size(); k++)
        {
            if (SS[j][k].first < a && SS[j][k].second > b)
                b = SS[j][k].second;
        }

        a = b;
    }
    return a;
}

컴파일 시 표준 에러 (stderr) 메시지

overtaking.cpp: In function 'void sortVecPair(std::vector<long long int>&, std::vector<int>&)':
overtaking.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for (int i = 0; i < vecA.size(); i++)
      |                     ~~^~~~~~~~~~~~~
overtaking.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < vecC.size(); i++)
      |                     ~~^~~~~~~~~~~~~
overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:60:31: 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]
   60 |             for (int k = 0; k < SS[j].size(); k++)
      |                             ~~^~~~~~~~~~~~~~
overtaking.cpp: In function 'long long int arrival_time(long long int)':
overtaking.cpp:82:27: 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]
   82 |         for (int k = 0; k < SS[j].size(); k++)
      |                         ~~^~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 0 / 26
• Subtask 5: 0 / 35