oj.uz

Submission #536592

# Submission time Handle Problem Language Result Execution time Memory
536592 2022-03-13T14:41:22 Z AbdullahMW CONSUL (info1cup19_consul) C++14
0.116806 / 100
 51 ms 256 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 < 60; i++)
    {
        ll pos = rand() % n + 1;
        ll elmnt = kth(pos);
        
        if (cnt(elmnt) > n / 3) 
        {
            say_answer(elmnt);
            return;
        }
    }
    
    say_answer(-1);
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.1168056695 / 65.0

# Verdict Execution time Memory Grader output
1 Partially correct 19 ms 208 KB Output is partially correct
2 Partially correct 32 ms 208 KB Output is partially correct
3 Correct 7 ms 208 KB Output is correct
4 Correct 8 ms 208 KB Output is correct
5 Partially correct 36 ms 208 KB Output is partially correct
6 Partially correct 36 ms 208 KB Output is partially correct
7 Partially correct 36 ms 208 KB Output is partially correct
8 Partially correct 51 ms 208 KB Output is partially correct
9 Partially correct 27 ms 208 KB Output is partially correct
10 Partially correct 35 ms 208 KB Output is partially correct
11 Partially correct 43 ms 208 KB Output is partially correct
12 Partially correct 33 ms 208 KB Output is partially correct
13 Partially correct 37 ms 208 KB Output is partially correct
14 Partially correct 33 ms 208 KB Output is partially correct