oj.uz

답안 #969098

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969098 2024-04-24T13:40:08 Z steveonalex CONSUL (info1cup19_consul) C++17
19 / 100
 381 ms 956 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void solve(int n){
    map<int, int> mp;
    for(int i = 1; i<=n; ++i) mp[kth(i)]++;
    for(pair<int, int> i: mp){
        if (i.second > n / 3) {
            say_answer(i.first);
            return;
        }
    }
    say_answer(-1);
}
 
// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     return 0;
// }

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 344 KB Output is correct

Subtask #2
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 31 ms 344 KB Output is partially correct
2 Partially correct 31 ms 344 KB Output is partially correct

Subtask #3
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 381 ms 956 KB Output is partially correct
2 Halted 0 ms 0 KB -