oj.uz

Submission #361998

# Submission time Handle Problem Language Result Execution time Memory
361998 2021-02-01T14:15:07 Z lukameladze Easter Eggs (info1cup17_eastereggs) C++14
87 / 100
 23 ms 492 KB 
# include <bits/stdc++.h>
#include "grader.h"
#define f first
#define s second
#define pb push_back
using namespace std;
long long le,ri, mid;
vector <int> v2;
vector <long long> v1;
vector <long long> vvv[1005];
int ans;
void dfs(int a, int p) {
     v1.pb(a);
     for (int i=0; i<(int)vvv[a].size(); i++) {
          if (vvv[a][i]!=p) {
               dfs(vvv[a][i],a);
          }
     }
}
int findEgg(int n, vector <pair <int, int > > vv)
{
     for (int i=1; i<=515; i++) {
          vvv[i].clear();
     }
     v1.clear();
     v2.clear();
         for (int i=0; i<(int)vv.size(); i++) {
          vvv[vv[i].f].pb(vv[i].s);
          vvv[vv[i].s].pb(vv[i].f);
     }
     dfs(1,0);
     le=0;
     ri=(int)v1.size()-1;
     while (le<=ri) {
          mid=(le+ri)/2;
          v2.clear();
          for (int i=0; i<=mid; i++) {
               v2.pb(v1[i]);
          }
          if (query(v2)==1) {
               ans=mid;
               ri=mid-1;
          }
          else le=mid+1;
     }
     return v1[ans];
}

Subtask #1
32.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 492 KB Number of queries: 5
2 Partially correct 1 ms 364 KB Number of queries: 5
3 Partially correct 1 ms 364 KB Number of queries: 5
4 Partially correct 1 ms 364 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 364 KB Number of queries: 9
2 Correct 14 ms 364 KB Number of queries: 9
3 Correct 23 ms 364 KB Number of queries: 9
4 Correct 19 ms 364 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 21 ms 364 KB Number of queries: 10
2 Correct 17 ms 364 KB Number of queries: 9
3 Partially correct 23 ms 364 KB Number of queries: 10
4 Partially correct 18 ms 364 KB Number of queries: 10