oj.uz

답안 #117446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117446 2019-06-16T00:08:47 Z duality Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 18672 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "meetings.h"

int M[2000][2000];
bitset<2000> P[2000],C[2000];
int lca(int v,int w,int N) {
    if ((v == 0) || (w == 0)) return 0;
    else if (v == w) return v;
    if (M[v][w] != -1) return M[v][w];
    else if (P[w][v] || C[v][w]) return v;
    else if (P[v][w] || C[w][v]) return w;
    else {
        M[v][w] = M[w][v] = Query(0,v,w);
        C[M[v][w]][v] = C[M[w][v]][w] = 1;
        P[v][M[v][w]] = P[w][M[v][w]] = 1;
        if (M[v][w] == v) P[w] |= P[v],C[v] |= C[w];
        else if (M[v][w] == w) P[v] |= P[w],C[w] |= C[v];
        else C[M[v][w]] |= C[v] | C[w];
        return M[v][w];
    }
}
int solve(vi v,int r,int N) {
    if (v.size() <= 1) return 0;
    int i,j;
    vector<vi> sub;
    vi child;
    for (i = 0; i < v.size(); i++) {
        int u = v[i];
        if (u == r) continue;
        if (sub.empty()) sub.pb(vi()),sub[0].pb(u),child.pb(u);
        else {
            int k,c;
            vpii order;
            for (j = 0; j < sub.size(); j++) order.pb(mp(sub[j].size(),j));
            sort(order.begin(),order.end(),greater<pii>());
            for (j = 0; j < sub.size(); j++) {
                k = order[j].second;
                if ((c=lca(child[k],u,N)) != r) break;
            }
            if (j == sub.size()) sub.pb(vi()),sub.back().pb(u),child.pb(u);
            else sub[k].pb(u),child[k] = c;
        }
    }
    for (i = 0; i < sub.size(); i++) {
        if (r < child[i]) Bridge(r,child[i]);
        else Bridge(child[i],r);
        solve(sub[i],child[i],N);
    }
    return 0;
}
void Solve(int N) {
    int i;
    vi v;
    for (i = 0; i < N; i++) v.pb(i);
    for (i = 0; i < N; i++) fill(M[i],M[i]+N,-1),P[i].reset(),C[i].reset();
    solve(v,0,N);
}

Compilation message

meetings.cpp: In function 'int solve(vi, int, int)':
meetings.cpp:82:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v.size(); i++) {
                 ~~^~~~~~~~~~
meetings.cpp:89:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < sub.size(); j++) order.pb(mp(sub[j].size(),j));
                         ~~^~~~~~~~~~~~
meetings.cpp:91:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < sub.size(); j++) {
                         ~~^~~~~~~~~~~~
meetings.cpp:95:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (j == sub.size()) sub.pb(vi()),sub.back().pb(u),child.pb(u);
                 ~~^~~~~~~~~~~~~
meetings.cpp:99:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < sub.size(); i++) {
                 ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 560 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 3 ms 640 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 2 ms 560 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 2 ms 640 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 3 ms 640 KB Output is correct
27 Correct 11 ms 2048 KB Output is correct
28 Correct 9 ms 2048 KB Output is correct
29 Correct 10 ms 2048 KB Output is correct
30 Correct 12 ms 2048 KB Output is correct
31 Correct 10 ms 2048 KB Output is correct
32 Correct 11 ms 2176 KB Output is correct
33 Correct 15 ms 2176 KB Output is correct
34 Correct 17 ms 2048 KB Output is correct
35 Correct 17 ms 2048 KB Output is correct
36 Correct 12 ms 2176 KB Output is correct
37 Correct 46 ms 2296 KB Output is correct
38 Correct 63 ms 2552 KB Output is correct
39 Correct 171 ms 2680 KB Output is correct

Subtask #4
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 994 ms 17548 KB Output is correct
2 Correct 1037 ms 17588 KB Output is correct
3 Correct 1012 ms 17504 KB Output is correct
4 Correct 1169 ms 17592 KB Output is correct
5 Correct 919 ms 17400 KB Output is correct
6 Correct 698 ms 17500 KB Output is correct
7 Correct 838 ms 17428 KB Output is correct
8 Correct 957 ms 17536 KB Output is correct
9 Correct 1008 ms 17580 KB Output is correct
10 Correct 918 ms 17528 KB Output is correct
11 Correct 907 ms 17448 KB Output is correct
12 Execution timed out 3060 ms 18672 KB Time limit exceeded
13 Halted 0 ms 0 KB -