Submission #67126744


Source Code Expand

Copy
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int q;
cin >> q;
for(;q--;){
int n,now,goal;
cin >> n >> now;
vector<int>num(n-2);
for(int i=0;i<n-2;i++)cin >> num[i];
cin >> goal;
sort(num.begin(),num.end());
int ans=2;
bool ok=false;
while(true){
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
  int q;
  cin >> q;
  for(;q--;){
    int n,now,goal;
    cin >> n >> now;
    vector<int>num(n-2);
    for(int i=0;i<n-2;i++)cin >> num[i];
    cin >> goal;

    sort(num.begin(),num.end());

    int ans=2;
    bool ok=false;
    
    while(true){
      if(now*2>=goal){
	ok=true;
	break;
      }
      int left=-1,right=num.size();
      while(left+1!=right){
	int mid=(left+right)/2;
	if(num[mid]>now*2)right=mid;
	else left=mid;
      }
      if(left==-1 || num[left]<=now)break;
      now=num[left];
      ans++;
    }
    if(ok==false)cout << -1 << endl;
    else cout << ans << endl;
  }
}

Submission Info

Submission Time
Task C - Giant Domino
User rotti
Language C++ 20 (gcc 12.2)
Score 300
Code Size 725 Byte
Status AC
Exec Time 156 ms
Memory 4012 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 1
AC × 32
Set Name Test Cases
Sample 00_sample_00.txt
All 00_sample_00.txt, 01_small_00.txt, 01_small_01.txt, 01_small_02.txt, 01_small_03.txt, 01_small_04.txt, 01_small_05.txt, 01_small_06.txt, 01_small_07.txt, 01_small_08.txt, 02_random_00.txt, 02_random_01.txt, 02_random_02.txt, 02_random_03.txt, 02_random_04.txt, 02_random_05.txt, 02_random_06.txt, 02_random_07.txt, 02_random_08.txt, 02_random_09.txt, 02_random_10.txt, 02_random_11.txt, 02_random_12.txt, 02_random_13.txt, 02_random_14.txt, 02_random_15.txt, 02_random_16.txt, 02_random_17.txt, 02_random_18.txt, 02_random_19.txt, 03_corner_00.txt, 03_corner_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3480 KiB
01_small_00.txt AC 65 ms 3484 KiB
01_small_01.txt AC 66 ms 3484 KiB
01_small_02.txt AC 47 ms 3464 KiB
01_small_03.txt AC 156 ms 3516 KiB
01_small_04.txt AC 124 ms 3520 KiB
01_small_05.txt AC 108 ms 3520 KiB
01_small_06.txt AC 96 ms 3524 KiB
01_small_07.txt AC 74 ms 3548 KiB
01_small_08.txt AC 64 ms 3480 KiB
02_random_00.txt AC 32 ms 3664 KiB
02_random_01.txt AC 62 ms 4008 KiB
02_random_02.txt AC 62 ms 3964 KiB
02_random_03.txt AC 43 ms 3608 KiB
02_random_04.txt AC 62 ms 3936 KiB
02_random_05.txt AC 44 ms 3960 KiB
02_random_06.txt AC 46 ms 3924 KiB
02_random_07.txt AC 46 ms 3924 KiB
02_random_08.txt AC 40 ms 3932 KiB
02_random_09.txt AC 46 ms 4004 KiB
02_random_10.txt AC 46 ms 3856 KiB
02_random_11.txt AC 36 ms 3692 KiB
02_random_12.txt AC 46 ms 3872 KiB
02_random_13.txt AC 46 ms 3928 KiB
02_random_14.txt AC 40 ms 3940 KiB
02_random_15.txt AC 46 ms 4008 KiB
02_random_16.txt AC 46 ms 4012 KiB
02_random_17.txt AC 41 ms 3968 KiB
02_random_18.txt AC 45 ms 3956 KiB
02_random_19.txt AC 46 ms 4008 KiB
03_corner_00.txt AC 1 ms 3480 KiB
03_corner_01.txt AC 1 ms 3608 KiB


2025-06-29 (Sun)
00:07:20 +09:00