제출 #1206394

#제출 시각아이디문제언어결과실행 시간메모리
1206394StefanSebezHack (APIO25_hack)C++20
25 / 100
2428 ms114964 KiB
#include "hack.h" #include <vector> #include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define ll long long #define ld long double const int N=1e6+10; vector<int>dvs[N+5]; int hack(){ for(int i=1;i<=N;i++) dvs[i].clear(); for(int i=1;i<=N;i++) for(int j=i;j<=N;j+=i) dvs[j].pb(i); int x=0; for(int i=N;i>=1&&x==0;i--){ if(collisions({1,i})==1){ x=i-1; } } int res=x; for(auto i:dvs[x]){ if(collisions({1,i+1})==1) res=min(res,i); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...