제출 #921860

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921860		boris_mihov	Meetings (JOI19_meetings)	C++17	100 / 100	1203 ms	1396 KiB

meetings

#include "meetings.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <random>
#include <vector>
 
typedef long long llong;
const int MAXN = 2000 + 10;
const int INF  = 1e9;
 
int n;
int sz[MAXN];
bool bl[MAXN];
int perm[MAXN];
bool alreadyAdded[MAXN];
std::vector <int> g[MAXN];
std::vector <int> c[MAXN];
std::vector <int> real[MAXN];
std::mt19937 rng(69420);
 
void removeEdge(int u, int v)
{
    if (u == -1 || v == -1)
    {
        return;
    }
    
    for (int &x : g[u])
    {
        if (x == v)
        {
            std::swap(x, g[u].back());
            g[u].pop_back();
            break;
        }
    }
 
    for (int &x : g[v])
    {
        if (x == u)
        {
            std::swap(x, g[v].back());
            g[v].pop_back();
            break;
        }
    }
}
 
void addEdge(int u, int v)
{
    // std::cout << "add edge: " << u << ' ' << v << '\n';
    if (u == -1 || v == -1)
    {
        return;
    }
 
    g[u].push_back(v);
    g[v].push_back(u);
}
 
void calcSize(int node, int par)
{
    sz[node] = 1;
    for (const int &u : g[node])
    {
        if (u == par || bl[u])
        {
            continue;
        }
 
        calcSize(u, node);
        sz[node] += sz[u];
    }
}
 
int findCentroid(int node, int par, int compSz)
{
    for (const int &u : g[node])
    {
        if (!bl[u] && u != par && sz[u] > compSz / 2)
        {
            return findCentroid(u, node, compSz);
        }
    }
 
    return node;
}
 
int decompose(int node)
{
    calcSize(node, -1);
    int cntr = findCentroid(node, -1, sz[node]);
    bl[cntr] = true;
 
    for (const int &u : g[cntr])
    {
        if (bl[u])
        {
            continue;
        }
 
        c[cntr].push_back(decompose(u));
        real[cntr].push_back(u);
    }
 
    return cntr;
}
 
void search(int node, int added)
{
    bool addedEdge = false;
    for (int i = 0 ; i < c[node].size() ; i++)
    {
        int res = Query(node, real[node][i], added);
        // std::cout << "      query res: " << node << ' ' << real[node][i] << ' ' << added << " = " << res << '\n';
        if (res == node)
        {
            continue;
        }

        if (res != node && res != real[node][i] && res != added)
        {
            removeEdge(node, real[node][i]);
            addEdge(node, res);
            addEdge(res, real[node][i]);
            addEdge(res, added);
            alreadyAdded[res] = true;
            return;
        }
 
        if (res == added)
        {
            removeEdge(node, real[node][i]);
            if (!addedEdge) 
            {
                addEdge(node, added);
                addedEdge = true;
            }
 
            addEdge(real[node][i], added);
            continue;
        }
 
        if (res == real[node][i])
        {
            search(c[node][i], added);
            return;
        }

        assert(false);
    }
 
    if (!addedEdge)
    {
        addEdge(node, added);
    }
}
 
void Solve(int N) 
{
    // std::cout << "CALL\n" << std::flush;
    n = N;
    std::iota(perm, perm + n, 0);
    std::shuffle(perm, perm + n, rng);

    for (int i = 0 ; i < n ; ++i)
    {
        g[i].clear();
        c[i].clear();
        real[i].clear();
    }
 
    g[perm[0]].push_back(perm[1]);
    g[perm[1]].push_back(perm[0]);
 
    // std::cout << "first: " << perm[0] << '\n';
    // std::cout << "second: " << perm[1] << '\n';
    for (int i = 2 ; i < n ; ++i)
    {
        if (alreadyAdded[perm[i]])
        {
            continue;
        }

        // std::cout << "here: " << perm[i] << '\n';
        for (int j = 0 ; j < n ; ++j)
        {
            c[j].clear();
            real[j].clear();
            std::shuffle(g[j].begin(), g[j].end(), rng);
        }
 
        std::fill(bl, bl + n, false);
        int root = decompose(perm[0]);        
    
        // for (int j = 0 ; j < n ; ++j)
        // {
        //     std::shuffle(c[j].begin(), c[j].end(), rng);
        // }
 
        search(root, perm[i]);
        // std::cout << "after adding\n";
        // for (int i = 0 ; i < n ; ++i)
        // {
        //     for (const int &u : g[i])
        //     {
        //         if (i <= u)
        //         {
        //             std::cout << i << ' ' << u << '\n';
        //         }
        //     }
        // }
    }
    
    // std::cout << "done\n";
    // for (int i = 0 ; i < n ; ++i)
    // {
    //     for (const int &u : g[i])
    //     {
    //         if (i <= u)
    //         {
    //             std::cout << i << ' ' << u << '\n';
    //         }
    //     }
    // }

    for (int i = 0 ; i < n ; ++i)
    {
        // std::cout << "i is: " << i << ' ' << n << ' ' << g[i].size() << '\n';
        for (const int &u : g[i])
        {
            // std::cout << "tell: " << i << ' ' << u << '\n';
            if (i < u)
            {
                Bridge(i, u);
            }
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

meetings.cpp: In function 'void search(int, int)':
meetings.cpp:114:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     for (int i = 0 ; i < c[node].size() ; i++)
      |                      ~~^~~~~~~~~~~~~~~~

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