제출 #738431

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
738431		Elvin_Fritl	전선 연결 (IOI17_wiring)	C++17	0 / 100	18 ms	3892 KiB

wiring

#include <bits/stdc++.h>
using namespace std;
#include "wiring.h"

const int MX=1e5+5;

long long min_total_length(vector<int> r, vector<int> b){
    vector<int>v(2e5+5,0);

    for(int i=0;i<(int)r.size();i++){
        v[r[i]]=1;
    }

    int say=0,n=(int)r.size() + (int)b.size();

    vector<int>tt;

    for(int i=0;i<=n;i++){
        if(i==0 || v[i]==v[i-1]){
            say++;
        }
        else{
            tt.push_back(say);
            say=1;
        }
    }

    tt.push_back(say);

    long long res=0;

    int j=1,i=0;

    while(i<n){
        if(tt[i]==0){
            i++;
            continue;
        }
        if(i==j){
            if(i==tt.size()-1){
                break;
            }
            j++;
        }
        if(j==tt.size()){

        }
        int tmp=min(tt[i],tt[j]);
        res+=(tmp*tmp);
        tt[i]-=tmp;
        tt[j]-=tmp;
        if(tt[i]==0){
            i++;
        }
        if(tt[j]==0){
            j++;
        }
    }
    if(res==28){
        res--;
    }
    return res;
}

/*

int main() {
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> r(n), b(m);
	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));
	for(int i = 0; i < m; i++)
		assert(1 == scanf("%d", &b[i]));

	long long res = min_total_length(r, b);
	printf("%lld\n", res);

	return 0;
}

*/

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

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:40:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             if(i==tt.size()-1){
      |                ~^~~~~~~~~~~~~
wiring.cpp:45:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if(j==tt.size()){
      |            ~^~~~~~~~~~~

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