This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
    #include <bits/stdc++.h>
    #include "grader.h"
    #define max(xx,yy) (xx > yy ? xx : yy)
    #define min(xx,yy) (xx > yy ? yy : xx)
    #define all(x) x.begin(), x.end()
    using namespace std;
    int findEgg(int N, vector< pair<int, int> > bridges){
       	int ans = 0;
       	for(int i = 0;i < N;++i)
       		ans += query({ i+1 });
        	
        return ans;
    }
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |