Submission #1305755

#TimeUsernameProblemLanguageResultExecution timeMemory
1305755hackstarHack (APIO25_hack)C++20
78.10 / 100
129 ms1928 KiB
#include "hack.h" #include <bits/stdc++.h> using namespace std; #define ll long long int hack(){ int low = 1; int high = 1e9; map<vector<ll>,int>cache; while(low<high){ int mid = (low+high)/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); int curr; if(cache.count(query)) curr=cache[query]; else { curr=collisions(query); cache[query]=curr; } if(curr){ high = mid; } else{ low = mid+1; } } return low; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...