제출 #429385

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
429385		peuch	Meetings (IOI18_meetings)	C++17	4 / 100	5596 ms	2764 KiB

meetings

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

const long long INF = 1e18;

int bSize;

struct node{
	long long val, lzVal;
	node (long long _val = INF, long long _lzVal = 0){
		val = _val, lzVal = _lzVal;
	}
	node operator + (node a){
		return node(min(val, a.val));
	}
};

struct query{
	int l, r, id;
	query (int _l = 0, int _r = 0, int _id = 0){
		l = _l, r = _r, id = _id;
	}
	bool operator < (query a){
		if(l / bSize == a.l / bSize) return r < a.r;
		return l < a.l;
	}
};

vector<long long> minimum_costs(vector<int> H, vector<int> L, vector<int> R){
	bSize = sqrt(H.size());
	vector<query> qry (L.size());
	vector<long long> ans (L.size());
	
	for(int i = 0; i < L.size(); i++){
		int a = L[i];
		int b = R[i];
		ans[i] = INF;
		for(int j = a; j <= b; j++){
			long long sum = H[j];
			long long maxi = H[j];
			for(int k = j + 1; k <= b; k++){
				maxi = max(maxi, (long long)H[k]);
				sum += maxi;
			}
			maxi = H[j];
			for(int k = j - 1; k >= a; k--){
				maxi = max(maxi, (long long)H[k]);
				sum += maxi;
			}
			ans[i] = min(ans[i], sum);
		}
	}
	
//	for(int i = 0; i < L.size(); i++)
//		qry[i] = query(L[i], R[i], i);
//	sort(qry.begin(), qry.end());
//	
//	int ini = 0;
//	int fim = -1;
//	for(int i = 0; i < qry.size(); i++){
//		int l = qry[i].l;
//		int r = qry[i].r;
//		int id = qry[i].id;
//		while(fim > r){
//			tira(fim);
//			fim--;
//		}
//		while(fim < r){
//			fim++;
//			add(fim);
//		}
//		while(ini < l){
//			tira(ini);
//			ini++;
//		}
//		while(ini > l){
//			ini--;
//			add(ini);
//		}
//		ans[id] = seg[1].val;
//	}
	
	return ans;
}

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

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:35:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for(int i = 0; i < L.size(); i++){
      |                 ~~^~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40