Submission #117443

#	Time	Username	Problem	Language	Result	Execution time	Memory
117443		duality	Meetings (JOI19_meetings)	C++14	29 / 100	3017 ms	18488 KiB

meetings

#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 c;
            for (j = 0; j < sub.size(); j++) {
                if ((c=lca(child[j],u,N)) != r) break;
            }
            if (j == sub.size()) sub.pb(vi()),sub.back().pb(u),child.pb(u);
            else sub[j].pb(u),child[j] = 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 (stderr)

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:88:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < sub.size(); j++) {
                         ~~^~~~~~~~~~~~
meetings.cpp:91: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:95:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < sub.size(); i++) {
                 ~~^~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 0 / 71