Submission #753868

# Submission time Handle Problem Language Result Execution time Memory
753868 2023-06-06T08:42:51 Z Xiaoyang Easter Eggs (info1cup17_eastereggs) C++17
6 / 100
2 ms 464 KB
#include<bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int lowbit(ll x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
#include "grader.h"


int findEgg (int n, vector < pair < int, int > > bridges)
{
    rep(i,1,n+1){
		vector<int>tmp;tmp.pb(i);
		if(query(tmp))return i;
	}
}	

Compilation message

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
   32 | }
      | ^
# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 292 KB Number of queries: 16
2 Partially correct 2 ms 208 KB Number of queries: 16
3 Partially correct 1 ms 292 KB Number of queries: 16
4 Partially correct 2 ms 208 KB Number of queries: 16
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 436 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -