Submission #272054

#TimeUsernameProblemLanguageResultExecution timeMemory
272054HalitEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
1 ms512 KiB
    #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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...