oj.uz

Submission #699080

# Submission time Handle Problem Language Result Execution time Memory
699080 2023-02-15T14:51:59 Z dkblossom Self Study (JOI22_ho_t2) C++14
0 / 100
 276 ms 6136 KB 
#include<bits/stdc++.h>
using namespace std;

#pragma gcc optimize('ofast','unroll-loops')

#define endl '\n'
#define ff first
#define ss second
#define pb emplace_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define rep(a,b,c) for(int a=b;a<c;a++)

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

const ll maxn = 300005;
const ll maxm = 200005;
const ll mod = 1000000007;

void solve(){
	ll n, m;
	ll arr[maxn];
	ll brr[maxn];

	cin >> n >> m;
	rep(i,0,n) cin >> arr[i];
	rep(i,0,n) cin >> brr[i], arr[i] = max(arr[i],brr[i]);

	ll l = 0;
	ll r = 1000000000000000000;

	while(l+1<r){
		ll mid = (l+r>>1);
		ll ac = 0;
		//cout<<mid<<endl;
		rep(i,0,n){
			if(arr[i]*m>=mid) ac -= m-(mid-1)/arr[i]-1;
			else ac += (mid-1)/arr[i]+1-m;
			//cout << ac << ' ';
		}//cout<<endl;
		if(ac>0) r = mid;
		else l = mid;
	}

	//cout<<(-1)/2<<endl;//int mid=18,ac=0;rep(i,0,n){if(arr[i]*m>=mid)ac-=m-(mid-1)/arr[i]-1;else ac+=(mid-arr[i]*m-1)/brr[i]+1;}cout<<ac<<endl;

	cout << l << endl;
}

int main(){
	//freopen("input.txt","r",stdin);
	//freopen("sol.txt","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
}

Compilation message

Main.cpp:4: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    4 | #pragma gcc optimize('ofast','unroll-loops')
      | 
Main.cpp: In function 'void solve()':
Main.cpp:36:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |   ll mid = (l+r>>1);
      |             ~^~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 155 ms 4948 KB Output is correct
12 Correct 156 ms 4948 KB Output is correct
13 Correct 154 ms 4988 KB Output is correct
14 Correct 150 ms 4992 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Incorrect 276 ms 6136 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Incorrect 276 ms 6136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 155 ms 4948 KB Output is correct
12 Correct 156 ms 4948 KB Output is correct
13 Correct 154 ms 4988 KB Output is correct
14 Correct 150 ms 4992 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Incorrect 276 ms 6136 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Incorrect 276 ms 6136 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 5 ms 4948 KB Output is correct
11 Correct 155 ms 4948 KB Output is correct
12 Correct 156 ms 4948 KB Output is correct
13 Correct 154 ms 4988 KB Output is correct
14 Correct 150 ms 4992 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Incorrect 276 ms 6136 KB Output isn't correct
17 Halted 0 ms 0 KB -