Submission #19319807
Source Code Expand
Copy
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
int main() {
int n;
cin >> n;
vector<ii> a(1 << n);
for (int i = 0; i < (1 << n); ++i) cin >> a[i].first, a[i].second = i + 1;
for (int k = 0; k < n - 1; ++k) {
vector<ii> b;
for (int i = 0; i < SZ(a); i += 2) {
b.push_back(max(a[i], a[i + 1]));
}
swap(a, b);
}
cout << (a[0] < a[1] ? a[0].second : a[1].second) << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - ABC Tournament |
User |
cuiaoxiang |
Language |
C++ (Clang 10.0.0) |
Score |
300 |
Code Size |
2921 Byte |
Status |
AC |
Exec Time |
59 ms |
Memory |
3660 KB |
Compile Error
./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
^
2 warnings generated.
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
extreme_00.txt, handmade_00.txt, handmade_01.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name |
Status |
Exec Time |
Memory |
extreme_00.txt |
AC |
45 ms |
3604 KB |
handmade_00.txt |
AC |
2 ms |
3152 KB |
handmade_01.txt |
AC |
2 ms |
3180 KB |
random_00.txt |
AC |
59 ms |
3536 KB |
random_01.txt |
AC |
59 ms |
3588 KB |
random_02.txt |
AC |
59 ms |
3660 KB |
random_03.txt |
AC |
3 ms |
3016 KB |
random_04.txt |
AC |
3 ms |
3160 KB |
random_05.txt |
AC |
3 ms |
3100 KB |
sample_01.txt |
AC |
2 ms |
3164 KB |
sample_02.txt |
AC |
2 ms |
3160 KB |
sample_03.txt |
AC |
2 ms |
3092 KB |