oj.uz

Submission #536598

# Submission time Handle Problem Language Result Execution time Memory
536598 2022-03-13T14:44:38 Z AbdullahMW CONSUL (info1cup19_consul) C++14
100 / 100
 22 ms 208 KB 
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
 
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
 
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
 
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
#include <grader.h>
#define ll int
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007
using namespace std;
 
void solve(ll n)
{
    srand(time(0));
    
    for (ll i = 0; i < 25; i++)
    {
        ll pos = rand() % n + 1;
        ll elmnt = kth(pos);
        
        if (cnt(elmnt) > n / 3) 
        {
            say_answer(elmnt);
            return;
        }
    }
    
    say_answer(-1);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 208 KB Output is correct
2 Correct 21 ms 208 KB Output is correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Correct 17 ms 208 KB Output is correct
6 Correct 21 ms 208 KB Output is correct
7 Correct 20 ms 208 KB Output is correct
8 Correct 22 ms 208 KB Output is correct
9 Correct 21 ms 208 KB Output is correct
10 Correct 19 ms 208 KB Output is correct
11 Correct 16 ms 208 KB Output is correct
12 Correct 13 ms 208 KB Output is correct
13 Correct 22 ms 208 KB Output is correct
14 Correct 21 ms 208 KB Output is correct