oj.uz

Submission #640857

# Submission time Handle Problem Language Result Execution time Memory
640857 2022-09-15T11:29:59 Z Baytoro Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 332 ms 21688 KB 
#include <bits/stdc++.h>
using namespace std;
#define Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}
int c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_Mayrambekov{
	cin>>n;
	vector<pair<int,int>> a(n+1);
	vector<int> b(n),ans(n+1);
	for(i=0;i<=n;i++){
		cin>>a[i].fr;
		a[i].sc=i;
	}
	for(i=0;i<n;i++)
		cin>>b[i];
	sort(all(a));
	sort(all(b));
	multiset<int> st;
	int x=a[0].fr;
	for(i=1;i<=n;i++){
		st.insert(a[i].fr-b[i-1]);
	}
	ans[a[0].sc]=*(st.rbegin());
	for(i=1;i<=n;i++){
		st.erase(st.find(a[i].fr-b[i-1]));
		st.insert(a[i-1].fr-b[i-1]);
		ans[a[i].sc]=*st.rbegin();
	}
	for(i=0;i<=n;i++)
		cout<<ans[i]<<' ';
	cout<<endl;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message

ho_t1.cpp: In function 'void solve()':
ho_t1.cpp:41:6: warning: unused variable 'x' [-Wunused-variable]
   41 |  int x=a[0].fr;
      |      ^
ho_t1.cpp: At global scope:
ho_t1.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main(){
      | ^~~~
ho_t1.cpp: In function 'void fopn(std::string)':
ho_t1.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 416 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 456 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 275 ms 20304 KB Output is correct
34 Correct 183 ms 21316 KB Output is correct
35 Correct 182 ms 20516 KB Output is correct
36 Correct 332 ms 21096 KB Output is correct
37 Correct 206 ms 21688 KB Output is correct
38 Correct 185 ms 21464 KB Output is correct
39 Correct 281 ms 20352 KB Output is correct
40 Correct 264 ms 20356 KB Output is correct
41 Correct 295 ms 20596 KB Output is correct
42 Correct 236 ms 20504 KB Output is correct
43 Correct 248 ms 20252 KB Output is correct
44 Correct 194 ms 19716 KB Output is correct
45 Correct 169 ms 19896 KB Output is correct
46 Correct 168 ms 19716 KB Output is correct
47 Correct 170 ms 20300 KB Output is correct
48 Correct 166 ms 20372 KB Output is correct
49 Correct 242 ms 20992 KB Output is correct
50 Correct 250 ms 20896 KB Output is correct
51 Correct 250 ms 20988 KB Output is correct
52 Correct 248 ms 20908 KB Output is correct
53 Correct 216 ms 20976 KB Output is correct