제출 #108478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108478		E869120	Bulldozer (JOI17_bulldozer)	C++14	5 / 100	3 ms	428 KiB

bulldozer

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

long long N, X[109], Y[109], W[109], maxn = 0;
vector<long long>A;

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> X[i] >> Y[i] >> W[i];
		A.push_back(X[i]);
	}
	sort(A.begin(), A.end());
	A.erase(unique(A.begin(), A.end()), A.end());

	for (int i = 0; i < A.size(); i++) {
		for (int j = i; j < A.size(); j++) {
			long long sum = 0;
			for (int k = 0; k < N; k++) {
				if (A[i] <= X[k] && X[k] <= A[j]) sum += W[k];
			}
			maxn = max(maxn, sum);
		}
	}
	cout << maxn << endl;
	return 0;
}

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

bulldozer.cpp: In function 'int main()':
bulldozer.cpp:18:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < A.size(); i++) {
                  ~~^~~~~~~~~~
bulldozer.cpp:19:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < A.size(); j++) {
                   ~~^~~~~~~~~~

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