oj.uz

답안 #201695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201695 2020-02-11T17:52:27 Z nikolapesic2802 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 413 ms 14840 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";
#define ld long double

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}

const int N=2e5+5;
int o(int a,int b){
	return max({0,a-b});
}
int main()
{
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int n;
	scanf("%i",&n);
	vector<pair<int,int> > a(n+1);
	vector<int> b(n),sol(n+1);
	for(int i=0;i<=n;i++){
		scanf("%i",&a[i].f);
		a[i].s=i;
	}
	sort(all(a));
	for(int i=0;i<n;i++)
		scanf("%i",&b[i]);
	sort(all(b));
	multiset<int> razlike;
	for(int i=0;i<n;i++)
		razlike.insert(o(a[i+1].f,b[i]));
	sol[a[0].s]=*razlike.rbegin();
	for(int i=1;i<=n;i++){
		razlike.erase(razlike.find(o(a[i].f,b[i-1])));
		razlike.insert(o(a[i-1].f,b[i-1]));
		sol[a[i].s]=*razlike.rbegin();
	}
	for(int i=0;i<=n;i++)
		printf("%i ",sol[i]);
	return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
ho_t1.cpp:44:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i",&a[i].f);
   ~~~~~^~~~~~~~~~~~~~
ho_t1.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i",&b[i]);
   ~~~~~^~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 380 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 7 ms 376 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 7 ms 504 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 7 ms 504 KB Output is correct
28 Correct 7 ms 376 KB Output is correct
29 Correct 6 ms 504 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 7 ms 376 KB Output is correct
32 Correct 6 ms 504 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 380 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 6 ms 376 KB Output is correct
21 Correct 7 ms 376 KB Output is correct
22 Correct 7 ms 376 KB Output is correct
23 Correct 6 ms 504 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 7 ms 504 KB Output is correct
26 Correct 6 ms 504 KB Output is correct
27 Correct 7 ms 504 KB Output is correct
28 Correct 7 ms 376 KB Output is correct
29 Correct 6 ms 504 KB Output is correct
30 Correct 6 ms 376 KB Output is correct
31 Correct 7 ms 376 KB Output is correct
32 Correct 6 ms 504 KB Output is correct
33 Correct 247 ms 13792 KB Output is correct
34 Correct 274 ms 14328 KB Output is correct
35 Correct 240 ms 13944 KB Output is correct
36 Correct 257 ms 14328 KB Output is correct
37 Correct 280 ms 14840 KB Output is correct
38 Correct 254 ms 14584 KB Output is correct
39 Correct 352 ms 13688 KB Output is correct
40 Correct 352 ms 13688 KB Output is correct
41 Correct 352 ms 13944 KB Output is correct
42 Correct 351 ms 13688 KB Output is correct
43 Correct 402 ms 13792 KB Output is correct
44 Correct 209 ms 13176 KB Output is correct
45 Correct 216 ms 13304 KB Output is correct
46 Correct 219 ms 13176 KB Output is correct
47 Correct 204 ms 13408 KB Output is correct
48 Correct 226 ms 13432 KB Output is correct
49 Correct 393 ms 14072 KB Output is correct
50 Correct 391 ms 14012 KB Output is correct
51 Correct 412 ms 14072 KB Output is correct
52 Correct 413 ms 14048 KB Output is correct
53 Correct 402 ms 14072 KB Output is correct