oj.uz

답안 #840486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840486 2023-08-31T12:21:45 Z ZeroCool A Plus B (IOI23_aplusb) C++17
10 / 100
 1 ms 212 KB 
#include "aplusb.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

vector<int> smallest_sums(int n, vector<int> A, vector<int> B) {
	set<int >s;
	priority_queue<tuple<int,int,int> , vector<tuple<int,int,int> > , greater<tuple<int,int,int> > > pq;


	pq.push({A[0] + B[0], 0, 0});
	set<pair<int,int> > st;
	vector<int> ans;
	for(int i = 0;i<n;i++){
		int val = get<0>(pq.top());
		int posa = get<1>(pq.top());
		int posb = get<1>(pq.top());
		pq.pop();

		ans.push_back(val);

		if(posa + 1 < n && !st.count({posa + 1, posb})){
			pq.push({A[posa + 1] + B[posb],posa+1, posb});
			st.insert({posa+1, posb});
		}

		if(posb + 1 < n && !st.count({posa, posb+1})){
			pq.push({A[posa] + B[posb+1],posa, posb+1});
			st.insert({posa, posb+1});
		}
	}
	
	return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #2
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 3rd token, expected: '2', found: '30'
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 3rd token, expected: '2', found: '30'
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 3rd token, expected: '2', found: '30'
8 Halted 0 ms 0 KB -