Submission #967351

#	Time	Username	Problem	Language	Result	Execution time	Memory
967351		steveonalex	Duathlon (APIO18_duathlon)	C++17	0 / 100	1 ms	348 KiB

count_triplets

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

const int INF = 10;
const int N = 25e4;

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n = 10, m = n+2;
    cout << n << " " << m << "\n";
    set<pair<int, int>> S;
    for(int i = 2; i<=n; ++i) S.insert({rngesus(1, i-1), i});
    for(int i = n; i<=m; ++i){
        while(true){
            int x = rngesus(1, n);
            int y = x;
            while(y == x) y = rngesus(1, n);
            if (x > y) swap(x, y);
            if (S.find(make_pair(x, y)) != S.end()) continue;
            S.insert(make_pair(x, y));
            break;
        }

    }
    for(pair<int, int> i: S) cout << i.first << " " << i.second << "\n";
    // int q = 10; cout << q << "\n";
    // while(q--) {
    //     int x = rngesus(0, n-1);
    //     int y = x;
    //     while(y == x) y = rngesus(0, n-1);
    //     cout << x << " " << y << "\n";
    // }

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 8
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 20
• Subtask 8: 0 / 8
• Subtask 9: 0 / 10