# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
681936 | Mher777 | Easter Eggs (info1cup17_eastereggs) | C++17 | 2 ms | 464 KiB |
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 <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
#include "grader.h"
using namespace std;
int findEgg (int n, vector<pair<int,int>> b) {
map<int, vector<int>> mp;
for (int i = 0; i < b.size(); i++) {
if (b[i].second < b[i].first) swap(b[i].first, b[i].second);
mp[b[i].first].push_back(b[i].second);
}
sort(b.begin(), b.end());
vector<bool> used(n + 5);
for (int i = 0; i < b.size(); i++) {
if (query({ b[i].first, b[i].second }) == 1) {
if (query({ b[i].first }) == 1) {
return b[i].first;
}
else {
return b[i].second;
}
}
else {
used[b[i].first] = true;
used[b[i].second] = true;
}
}
for (int i = 1; i <= n; i++) {
if (!used[i] && query({i})) {
return i;
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |