oj.uz

답안 #866533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
866533 2023-10-26T10:33:32 Z vjudge1 메기 농장 (IOI22_fish) C++17
0 / 100
 73 ms 14696 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long// !
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define F first
#define S second


ll max_weights(int n, int m, vector<int> X, std::vector<int> Y, vector<int> W) {
	vector<pair<int, int>> pos[2];
	for (int i = 0; i < m; i++){
		pos[X[i]].push_back({Y[i], W[i]});
	}
	sort(all(pos[0]));
	sort(all(pos[1]));
	ll cnt0 = 0;
	for (auto [y, w] : pos[0]) cnt0 += w;
	ll cnt1 = 0;
	for (auto [y, w] : pos[1]) cnt1 += w;
	ll ans = max(cnt0, cnt1);
	int p = 0;
	ll cnt = 0;
	for (auto [y, w] : pos[0]){
		if (y) ans = max(ans, w + cnt1);
	}
	for (auto [y, w] : pos[0]){
		while (p < sz(pos[1]) && pos[1][p].F <= y){
			cnt1 -= pos[1][p].S;
			p++;
		}
		cnt += w;
		ans = max(ans, cnt + cnt1);
	}
	p = 0;
	cnt = 0;
	for (auto [y, w] : pos[1]){
		while (p < sz(pos[0]) && pos[0][p].F < y){
			cnt += pos[0][p].S;
			p++;
		}
		cnt += w;
		ans = max(ans, cnt);
		cnt -= w;
	}
	return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 3284 KB Output is correct
2 Correct 29 ms 3792 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Runtime error 73 ms 14696 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 50 ms 5832 KB Output is correct
3 Correct 61 ms 10300 KB Output is correct
4 Correct 24 ms 4820 KB Output is correct
5 Correct 31 ms 5556 KB Output is correct
6 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 348 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 3284 KB Output is correct
2 Correct 29 ms 3792 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Runtime error 73 ms 14696 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -