# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017587 | Ludissey | Bitaro’s Party (JOI18_bitaro) | C++14 | 150 ms | 140880 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//JAVAIS BESOIN DU HINT :(
#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define last(a) a[sz(a)-1]
using namespace std;
using namespace std::chrono;
vector<pair<int,bool>> memo;
vector<bool> visited;
vector<vector<int>> neigh;
vector<vector<pair<int,int>>> minsqrt;
vector<bool> mp;
int timer=0;
int SQRT=0;
int mnDP2=0;
int c=0;
void dp(int x){
if(visited[x]) return;
visited[x]=true;
unordered_map<int,bool> mp2;
for (auto t : neigh[x]) {
vector<pair<int,int>> nw;
dp(t);
int i=0;
for (auto u : minsqrt[t])
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |