oj.uz

Submission #269717

# Submission time Handle Problem Language Result Execution time Memory
269717 2020-08-17T09:09:02 Z Fasho Easter Eggs (info1cup17_eastereggs) C++14
10 / 100
 2 ms 512 KB 
#include <bits/stdc++.h>
#define NNN 100005
#define ll long long int
#define fo(i,x,y)	for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll> 
#include "grader.h"
using namespace std;

ll n,m,ar[NNN],sum,t;


int findEgg (int NN, vector < pair < int, int > > bridges)
{
	n=NN;
	fo(i,1,n-1)
	{
		if(query({i}))
			return i;
	}
    // if (query ({1})) return 1;
    return n;
}

Subtask #1
10.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 256 KB Number of queries: 15
2 Partially correct 2 ms 256 KB Number of queries: 15
3 Partially correct 2 ms 256 KB Number of queries: 15
4 Partially correct 2 ms 256 KB Number of queries: 15

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -