oj.uz

Submission #292455

# Submission time Handle Problem Language Result Execution time Memory
292455 2020-09-07T02:50:40 Z jbroeksteeg Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 350 ms 19448 KB 
#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>

#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int __i = 0; __i<(int)a.size();__i++){cin>>a[__i];}

// jimjam

template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n; cin >> n;
	vector<pair<int,int>> ties(n+1), people(n);
	for (int i = 0; i < n + 1; i++) {
		cin >> ties[i].first;
		ties[i].second = i;
	}
	for (int i = 0; i < n; i++) {
		cin >> people[i].first;
		people[i].second = i;
	}
	sort(ties.begin(),ties.end());
	sort(people.begin(),people.end());
	vector<int> answer(n+1, INT_MAX);
	
//	for (int i = 0; i < 10; i++) {
//		int l = 0;
//		for (int j = 0; j < 9; j++) {
//			if (l==i) l++;
//			cout << j << ":" << l << ", ";
//			l++;
//		}
//		cout << endl;
//	}
	// initially, take the first one 
	// max of (tie - person)
	
	multiset<int> current;
	for (int i = 0; i < n; i++) {
		current.insert( max(ties[i+1].first - people[i].first, 0) );
	}
	answer[ ties[0].second ] = *prev(current.end());

	for (int i = 1; i <= n; i++) {
		current.erase(current.find( max(ties[i].first - people[i-1].first, 0) ));
		current.insert(ties[i-1].first-people[i-1].first);
		answer[ ties[i].second ] = *prev(current.end());
	}
	for (int i: answer) cout << i << " ";
	cout << endl;

	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 512 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 226 ms 18168 KB Output is correct
34 Correct 246 ms 19100 KB Output is correct
35 Correct 226 ms 18424 KB Output is correct
36 Correct 237 ms 18936 KB Output is correct
37 Correct 243 ms 19448 KB Output is correct
38 Correct 230 ms 19192 KB Output is correct
39 Correct 336 ms 18244 KB Output is correct
40 Correct 315 ms 18168 KB Output is correct
41 Correct 317 ms 18296 KB Output is correct
42 Correct 309 ms 18300 KB Output is correct
43 Correct 325 ms 18216 KB Output is correct
44 Correct 208 ms 17656 KB Output is correct
45 Correct 209 ms 17788 KB Output is correct
46 Correct 214 ms 17656 KB Output is correct
47 Correct 203 ms 18168 KB Output is correct
48 Correct 203 ms 18296 KB Output is correct
49 Correct 340 ms 18808 KB Output is correct
50 Correct 350 ms 18660 KB Output is correct
51 Correct 335 ms 18808 KB Output is correct
52 Correct 339 ms 18680 KB Output is correct
53 Correct 341 ms 18808 KB Output is correct