Submission #61593500

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Problem: E - Simultaneous Kagamimochi
// Contest: AtCoder - HHKB Programming Contest 2025(AtCoder Beginner Contest 388)
// URL: https://atcoder.jp/contests/abc388/tasks/abc388_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define rep1(i, a, b) for (int i = (a); i <= (b); i++)
#define rep2(i, b, a) for (int i = (b); i >= (a); i--)
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr double PI = 3.14159265358979323846;
constexpr ll llmax = 1e18;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

// Problem: E - Simultaneous Kagamimochi
// Contest: AtCoder - HHKB Programming Contest 2025(AtCoder Beginner Contest 388)
// URL: https://atcoder.jp/contests/abc388/tasks/abc388_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define int long long
#define pb push_back
#define rep1(i, a, b) for (int i = (a); i <= (b); i++)
#define rep2(i, b, a) for (int i = (b); i >= (a); i--)

using ll = long long;
using ull = unsigned long long;
using namespace std;

constexpr double PI = 3.14159265358979323846;
constexpr ll llmax = 1e18;
constexpr ll llmin = -1e18;
constexpr char nl = '\n';

template <typename T> bool chkmin(T &a, T b) {
	return (b < a) ? a = b, 1 : 0;
}

template <typename T> bool chkmax(T &a, T b) {
	return (b > a) ? a = b, 1 : 0;
}

void solve_case();

signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int Tests = 1;
	// cin >> Tests;
	while (Tests--) {
		solve_case();
	}

	return 0;
}

void solve_case() {
	int n; cin>>n;
	vector<int>a(n+1);
	rep1(i,1,n)cin>>a[i];
	int cnt=0;
	int j=1;
	for(int i=1;i<=n;i++){
		auto it=lower_bound(a.begin()+j+1, a.end(), 2*a[i]);
		if(it != a.end()){
			j=it-a.begin();
			cnt++;
		}
		else break;
	}
	cout<<cnt;
}

Submission Info

Judge Result