# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146005 | damyann | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 460 KiB |
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>v[512];
vector<int>s;
int used[515];
void topSort(int beg)
{
used[beg]=1;
s.push_back(beg);
int sz=v[beg].size();
for(int i=0;i<sz;i++)
{
if(!used[v[beg][i]])
topSort(v[beg][i]);
}
}
int binSearch(int n)
{
int l=1,r=n,mid;
while(l<r)
{
mid=(l+r)/2;
vector<int>h;
for(int i=0;i<mid;i++)
h.push_back(s[i]);
if(query(h))
r=mid;
else
l=mid+1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |