제출 #1205453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205453		bronze_coder	Hack (APIO25_hack)	C++20	82.60 / 100	86 ms	964 KiB

hack

#include "hack.h"
#include <bits/stdc++.h>
using namespace std;

int squareroot(int n){
    int x = sqrt(n);
    while(x*x<n){
        x++;
    }
    while(x*x>n){
        x--;
    }
    return x;
}

int hack(){
    int low = 1;
    int high = 1000000000;
    while(low<high){
        int mid = (low+high)/2;
        int low1 = low;
        low = max(low,mid/2);
        int s = sqrt(mid-low+1);
        vector<long long> query;
        for(int i=0;i<s;i++){
            query.push_back(i+1);
        }
        for(int i=0;low+s*(i+1)<=mid;i++){
            query.push_back(low+s*(i+1));
        }
        query.push_back(mid+1);
        low = low1;
        if(collisions(query)){
            high = mid;
        }
        else{
            low = mid+1;
        }
    }
    return low;
}

• Subtask 0: 0 / 0
• Subtask 1: 8 / 8
• Subtask 2: 17 / 17
• Subtask 3: 57.5879 / 75