제출 #1330353

#제출 시각아이디문제언어결과실행 시간메모리
1330353KhoaDuyHack (APIO25_hack)C++20
57.20 / 100
132 ms1952 KiB
#include "hack.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int blsz=7630;
const int MAXN=1e9;
int hack(){
    int blcnt=(MAXN/blsz);
    int a=0,b=0;
    vector<ll> def;
    for(int i=1;i<=blsz;i++){
        def.push_back(i);
    }
    for(int i=__lg(blcnt);i>=0;i--){
        vector<ll> v=def;
        for(int bruh=0;bruh<(1<<i);bruh++){
            v.push_back(v.back()+blsz);
        }
        if(!collisions(v)){
            a+=(1<<i);
            def.push_back(def.back()+1LL*(1<<i)*blsz);
        }
    }
    if(a==0){
        if(!collisions(def)){
            a++;
        }
    }
    else{
        a++;
    }
    for(b=0;b+1<blsz;b++){
        if(a==0&&b==0){
            continue;
        }
        if(collisions({1,1+1LL*a*blsz+b})){
            break;
        }
    }
    return (a*blsz+b);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...