oj.uz

답안 #252846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252846 2020-07-26T10:48:37 Z ne4eHbKa Drzava (COCI15_drzava) C++17
8 / 160
 99 ms 65540 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 5e4 + 5;

int n, k, c[N], nm[N];

struct city {
    int x, y;
    city(int i) {
        cin >> x >> y >> c[i];
        c[i] = 1 << c[i] % k;
    }
};

vector<city> cs;

inline ll sq(ll x) {re x * x;}

struct edge {
    int u, v;
    ll dist;
    edge(int u, int v): u(u), v(v) {
        const auto &fi = cs[u], &se = cs[v];
        dist = sq(fi.x - se.x) + sq(fi.y - se.y);
//        cerr << u + 1 _ v + 1 _ dist << endl;
    }
    bool operator< (const edge &f) const {
        return dist < f.dist;
    }
};
vector<edge> es;

int p[N];
int get(int i) { re i == p[i] ? i : p[i] = get(p[i]); }

void solve() {
    cin >> n >> k;
    cs.clear();
    fo(n) cs.emplace_back(i);
    es.clear();
    fo(n) fr(j, i) es.emplace_back(j, i);
    sort(bnd(es));
    iota(p, p + n, 0);
    const int mx = (1 << k) - 1;
    for(auto &i : es) {
        int x = get(i.u);
        int y = get(i.v);
        if(x == y) continue;
//        fo(k) cout << ((c[x] >> i) & 1); cout << endl;
//        fo(k) cout << ((c[y] >> i) & 1); cout << endl;
        int fi = c[x], se = c[y];
        c[y] = 0;
        fo(k) {
            ifn(fi >> i & 1) continue;
            for(int j = 0; j + i < k; ++j) {
                ifn(se >> j & 1) continue;
                c[y] |= 1 << i + j;
            }
            for(int j = k - i; j < k; ++j) {
                ifn(se >> j & 1) continue;
                c[y] |= 1 << i + j - k;
            }
        }
//        fo(k) cout << ((c[y] >> i) & 1); cout << endl; cout << endl;
        if(c[y] & 1) return void
            (cout << sqrt(ld(i.dist)) << endl);
        p[x] = y;
    }
    cout << "wat\n";
}

int main() {
    cout.precision(3); cout << fixed;
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

drzava.cpp: In function 'int m_bpow(ll, ll)':
drzava.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~
drzava.cpp: In function 'void solve()':
drzava.cpp:117:32: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
                 c[y] |= 1 << i + j;
                              ~~^~~
drzava.cpp:121:36: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
                 c[y] |= 1 << i + j - k;
                              ~~~~~~^~~
drzava.cpp:104:15: warning: unused variable 'mx' [-Wunused-variable]
     const int mx = (1 << k) - 1;
               ^~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 52 ms 8696 KB Output is correct

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Runtime error 80 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #10
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Runtime error 80 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #12
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #16
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #17
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Runtime error 88 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #18
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Runtime error 99 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #20
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -