Submission #937996

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
937996	2024-03-04T17:29:51 Z	Litusiano	Self Study (JOI22_ho_t2)	C++17	0 / 100	426 ms	4956 KB

Main

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
 
vector<pair<int,int>> v;
int n,m;
bool check(int mid){
	int tot = 0;
	for(auto x : v){
		// if(tot > n*m) break;
		int mx = max(x.first,x.second);
		int need = (mid+mx-1)/mx;
		if(need < 0) continue;
		if(need > m){
			tot+=m;
			int k = (mid-mx*m + x.second-1);
			if(k < 0) continue;
			tot+= (mid-mx*m + x.second-1)/x.second;
		}
		else tot+= need;
	}
	return tot <= n*m;
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	v.resize(n);
	for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second;
	int low = 0; int high = 1e18+5;
	while(high > low+1){
		int middle = (low+high)/2;
		if(check(middle)) low = middle;
		else high = middle;
	}
	cout<<low<<endl;
}	

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:31:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   31 |  for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second;
      |  ^~~
Main.cpp:31:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   31 |  for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second;
      |                                 ^~~

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	200 ms	4952 KB	Output is correct
12	Correct	201 ms	4956 KB	Output is correct
13	Correct	208 ms	4952 KB	Output is correct
14	Incorrect	426 ms	4952 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	104 ms	2652 KB	Output is correct
10	Correct	69 ms	1884 KB	Output is correct
11	Correct	51 ms	1628 KB	Output is correct
12	Correct	42 ms	1372 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	8 ms	348 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	200 ms	4952 KB	Output is correct
12	Correct	201 ms	4956 KB	Output is correct
13	Correct	208 ms	4952 KB	Output is correct
14	Incorrect	426 ms	4952 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	104 ms	2652 KB	Output is correct
10	Correct	69 ms	1884 KB	Output is correct
11	Correct	51 ms	1628 KB	Output is correct
12	Correct	42 ms	1372 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	8 ms	348 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	200 ms	4952 KB	Output is correct
12	Correct	201 ms	4956 KB	Output is correct
13	Correct	208 ms	4952 KB	Output is correct
14	Incorrect	426 ms	4952 KB	Output isn't correct
15	Halted	0 ms	0 KB	-