제출 #1060307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060307		TahirAliyev	Wiring (IOI17_wiring)	C++17	0 / 100	1 ms	348 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define oo 1e9

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    #define int long long
    int n = r.size() + b.size();
    vector<pii> v = {{0, 0}};
    for(int a : r) v.push_back({a, 0});
    for(int a : b) v.push_back({a, 1});
    sort(v.begin() + 1, v.end());
    vector<int> pre(n + 1, 0), prex(n + 1, 0), dp(n + 1, 0);
    map<int, int> mp = {{0, 0}};
    for(int i = 1; i <= n; i++){
        pre[i] = pre[i - 1] + ((v[i].second)? -1 : 1);
        prex[i] = prex[i - 1] + ((v[i].second)? -1 : 1) * v[i].first;
        int id = oo;
        if(v[i].second){
            id = lower_bound(r.begin(), r.end(), v[i].first) - r.begin();
            if(id != r.size()) id = min(id, r[id] - v[i].first);
            if(id - 1 != -1) id = min(id, v[i].first - r[id - 1]);
        } 
        else{
            id = lower_bound(b.begin(), b.end(), v[i].first) - b.begin();
            if(id != b.size()) id = min(id, b[id] - v[i].first);
            if(id - 1 != -1) id = min(id, v[i].first - b[id - 1]);
        } 
        dp[i] = dp[i - 1] + id;
        if(mp.count(pre[i])){
            id = mp[pre[i]];
            dp[i] = min(dp[id] + abs(prex[i] - prex[id]), dp[i]);
        }
        mp[pre[i]] = i;
    }
    #undef int
    return dp[n];
}

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

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:22:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |             if(id != r.size()) id = min(id, r[id] - v[i].first);
      |                ~~~^~~~~~~~~~~
wiring.cpp:27:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             if(id != b.size()) id = min(id, b[id] - v[i].first);
      |                ~~~^~~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45