제출 #637323

#제출 시각아이디문제언어결과실행 시간메모리
637323boris_mihov전선 연결 (IOI17_wiring)C++17
0 / 100
15 ms1412 KiB
#include "wiring.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#include <set>

typedef long long llong;
const int MAXN = 100000 + 10;

long long min_total_length(std::vector <int> r, std::vector <int> b) 
{
    int ptr = 0;
    llong ans = 0;
    if (b.size() < r.size()) std::swap(r, b);
    for (int i = 0 ; i < b.size() ; ++i)
    {
        if (b.size() - i == r.size() - ptr - 1 || (ptr + 1 != r.size() && abs(r[ptr] - b[i]) > abs(r[ptr + 1] - b[i]))) ++ptr;
        ans += abs(b[i] - r[ptr]);
    }

	return ans;
}

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

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:16:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int i = 0 ; i < b.size() ; ++i)
      |                      ~~^~~~~~~~~~
wiring.cpp:18:60: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         if (b.size() - i == r.size() - ptr - 1 || (ptr + 1 != r.size() && abs(r[ptr] - b[i]) > abs(r[ptr + 1] - b[i]))) ++ptr;
      |                                                    ~~~~~~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...