oj.uz

답안 #862893

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
862893 2023-10-19T09:57:51 Z Youssif_Elkadi Logičari (COCI21_logicari) C++17
110 / 110
 94 ms 54868 KB 
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 2, mod = 1e9 + 7;
vector<long long> adj[N];
vector<long long> cy;
long long dp[N][4], dp2[N][6][6];
bool vis[N];
long long par[N];
long long n, hi;
void cyc(long long u)
{
    vis[u] = 1;
    for (auto v : adj[u])
    {
        if (hi)
            return;
        if (v == par[u])
            continue;
        par[v] = u;
        if (vis[v])
            hi = v;
        if (hi)
            return;
        cyc(v);
    }
    vis[u] = 0;
}
void calc(long long u, long long p)
{
    bool flag = 0;
    long long cnt[4] = {}, sum[4] = {};
    for (auto v : adj[u])
    {
        if (vis[v] || v == p)
            continue;
        calc(v, u);
        for (long long i = 0; i < 4; i++)
            cnt[i] += (dp[v][i] == -1), sum[i] += dp[v][i];
        flag = 1;
    }
    if (!flag)
    {
        dp[u][3] = dp[u][1] = 0;
        dp[u][0] = dp[u][2] = -1;
        return;
    }
    for (long long i = 0; i < 4; i++)
        dp[u][i] = mod;
    for (auto v : adj[u])
    {
        if (vis[v] || v == p)
            continue;
        // calc dp[u][0]
        if (dp[v][1] != -1 && cnt[3] - (dp[v][3] == -1) == 0)
            dp[u][0] = min(dp[u][0], dp[v][1] + (sum[3] - dp[v][3]) + 2);
        // calc dp[u][1]
        if (cnt[3] == 0)
            dp[u][1] = sum[3];
        // calc dp[u][2]
        if (dp[v][0] != -1 && cnt[2] - (dp[v][2] == -1) == 0)
            dp[u][2] = min(dp[u][2], dp[v][0] + (sum[2] - dp[v][2]));
        // calc dp[u][3]
        if (cnt[2] == 0)
            dp[u][3] = sum[2];
    }
    for (long long i = 0; i < 4; i++)
        dp[u][i] = (dp[u][i] == mod ? -1 : dp[u][i]);
}
/*
dp[u][0]= one dp[v][1] AND all dp[v][3] (source)
dp[u][1]= all dp[v][3] (partner)
dp[u][2]= one dp[v][0] AND all dp[v][2] (parent)
dp[u][3]= all dp[v][2] (nothing)
*/
/*
states:
0: means i am blue
1: means i am sec blue
2: i am after 1 OR 4
3: i am behind 0 OR 4
4: means i am blue and i dont want partner
5: I AM NOTHING, I DEPEND ON MY OWN YOU HEAR ME?

*/
long long solve(long long ind, long long lst, long long st)
{
    if (~dp2[ind][lst][st])
        return dp2[ind][lst][st];
    if (ind == cy.size())
    {
        if (lst == 0 && st == 1)
            return 0;
        if (lst == 1 && st == 2)
            return 0;
        if (lst == 2 && st == 3)
            return 0;
        if (lst == 3 && (st == 0 || st == 4))
            return 0;
        if (lst == 4 && st == 2)
            return 0;
        if (lst == 5 && !(st == 0 || st == 1 || st == 4))
            return 0;
        return mod;
    }
    long long ret = mod;
    if (ind == 0)
    {
        // ret = solve(ind + 1, 4, 4) + dp[cy[ind]][0];
        for (long long i = 0; i <= 5; i++)
        {
            if ((i == 2 || i == 3) && dp[cy[ind]][3] != -1)
                ret = min(ret, solve(ind + 1, i, i) + dp[cy[ind]][3]);
            else if (i == 4 && dp[cy[ind]][0] != -1)
                ret = min(ret, solve(ind + 1, i, i) + dp[cy[ind]][0]);
            else if ((i == 0 || i == 1) && dp[cy[ind]][1] != -1)
                ret = min(ret, solve(ind + 1, i, i) + dp[cy[ind]][1] + (i == 0) * 2);
            else if (i == 5 && dp[cy[ind]][2] != -1)
                ret = min(ret, solve(ind + 1, i, i) + dp[cy[ind]][2]);
        }
    }
    else
    {
        if (lst == 0 && dp[cy[ind]][1] != -1)
            ret = solve(ind + 1, 1, st) + dp[cy[ind]][1];
        if (lst == 1 && dp[cy[ind]][3] != -1)
            ret = solve(ind + 1, 2, st) + dp[cy[ind]][3];
        if (lst == 2 && dp[cy[ind]][3] != -1)
            ret = min(ret, solve(ind + 1, 3, st) + dp[cy[ind]][3]);
        if (lst == 2 && dp[cy[ind]][2] != -1) // new
            ret = min(ret, solve(ind + 1, 5, st) + dp[cy[ind]][2]);
        if (lst == 3 && dp[cy[ind]][1] != -1)
            ret = min(ret, solve(ind + 1, 0, st) + dp[cy[ind]][1] + 2);
        if (lst == 3 && dp[cy[ind]][0] != -1)
            ret = min(ret, solve(ind + 1, 4, st) + dp[cy[ind]][0]);
        if (lst == 4 && dp[cy[ind]][3] != -1)
            ret = min(ret, solve(ind + 1, 2, st) + dp[cy[ind]][3]);
        if (lst == 5 && dp[cy[ind]][2] != -1) // new
            ret = min(ret, solve(ind + 1, 5, st) + dp[cy[ind]][2]);
        if (lst == 5 && dp[cy[ind]][3] != -1) // new
            ret = min(ret, solve(ind + 1, 3, st) + dp[cy[ind]][3]);
    }
    return dp2[ind][lst][st] = ret;
}
int main()
{
    memset(dp2, -1, sizeof dp2);
    cin >> n;
    for (long long i = 0; i < n; i++)
    {
        long long x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    cyc(1);
    long long tmp = hi;
    while (true)
    {
        cy.push_back(tmp);
        vis[tmp] = 1;
        tmp = par[tmp];
        if (tmp == hi)
            break;
    }
    for (long long i = 1; i <= n; i++)
        vis[i] = 0;
    // for (auto v : cy)
    //     cout << v << " ";
    for (auto v : cy)
        vis[v] = 1;
    for (auto v : cy)
        calc(v, 0);
    long long tmpp = solve(0, 0, 0); // (2 4 3)
    // cout << dp[2][0] << " " << dp[4][3] << " " << dp[3][3] << " ";
    if (tmpp == mod)
        cout << -1;
    else
        cout << tmpp;
}

Compilation message

Main.cpp: In function 'long long int solve(long long int, long long int, long long int)':
Main.cpp:89:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |     if (ind == cy.size())
      |         ~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34648 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 5 ms 34780 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 79 ms 47928 KB Output is correct
6 Correct 88 ms 47824 KB Output is correct
7 Correct 79 ms 47824 KB Output is correct
8 Correct 78 ms 47752 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 5 ms 34808 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 5 ms 34652 KB Output is correct
6 Correct 5 ms 34908 KB Output is correct
7 Correct 5 ms 34904 KB Output is correct
8 Correct 5 ms 34812 KB Output is correct
9 Correct 5 ms 34652 KB Output is correct
10 Correct 5 ms 34652 KB Output is correct
11 Correct 5 ms 34652 KB Output is correct
12 Correct 5 ms 34652 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34652 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 5 ms 34808 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 5 ms 34652 KB Output is correct
6 Correct 5 ms 34908 KB Output is correct
7 Correct 5 ms 34904 KB Output is correct
8 Correct 5 ms 34812 KB Output is correct
9 Correct 5 ms 34652 KB Output is correct
10 Correct 5 ms 34652 KB Output is correct
11 Correct 5 ms 34652 KB Output is correct
12 Correct 5 ms 34652 KB Output is correct
13 Correct 5 ms 34652 KB Output is correct
14 Correct 5 ms 34812 KB Output is correct
15 Correct 5 ms 34840 KB Output is correct
16 Correct 5 ms 34652 KB Output is correct
17 Correct 5 ms 34652 KB Output is correct
18 Correct 5 ms 34652 KB Output is correct
19 Correct 5 ms 34652 KB Output is correct
20 Correct 5 ms 34840 KB Output is correct
21 Correct 5 ms 34652 KB Output is correct
22 Correct 5 ms 34652 KB Output is correct
23 Correct 6 ms 34908 KB Output is correct
24 Correct 5 ms 34744 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 34648 KB Output is correct
2 Correct 5 ms 34652 KB Output is correct
3 Correct 5 ms 34780 KB Output is correct
4 Correct 5 ms 34652 KB Output is correct
5 Correct 79 ms 47928 KB Output is correct
6 Correct 88 ms 47824 KB Output is correct
7 Correct 79 ms 47824 KB Output is correct
8 Correct 78 ms 47752 KB Output is correct
9 Correct 5 ms 34652 KB Output is correct
10 Correct 5 ms 34652 KB Output is correct
11 Correct 5 ms 34808 KB Output is correct
12 Correct 5 ms 34652 KB Output is correct
13 Correct 5 ms 34652 KB Output is correct
14 Correct 5 ms 34908 KB Output is correct
15 Correct 5 ms 34904 KB Output is correct
16 Correct 5 ms 34812 KB Output is correct
17 Correct 5 ms 34652 KB Output is correct
18 Correct 5 ms 34652 KB Output is correct
19 Correct 5 ms 34652 KB Output is correct
20 Correct 5 ms 34652 KB Output is correct
21 Correct 5 ms 34652 KB Output is correct
22 Correct 5 ms 34812 KB Output is correct
23 Correct 5 ms 34840 KB Output is correct
24 Correct 5 ms 34652 KB Output is correct
25 Correct 5 ms 34652 KB Output is correct
26 Correct 5 ms 34652 KB Output is correct
27 Correct 5 ms 34652 KB Output is correct
28 Correct 5 ms 34840 KB Output is correct
29 Correct 5 ms 34652 KB Output is correct
30 Correct 5 ms 34652 KB Output is correct
31 Correct 6 ms 34908 KB Output is correct
32 Correct 5 ms 34744 KB Output is correct
33 Correct 57 ms 39216 KB Output is correct
34 Correct 55 ms 38996 KB Output is correct
35 Correct 56 ms 39044 KB Output is correct
36 Correct 54 ms 39212 KB Output is correct
37 Correct 16 ms 35932 KB Output is correct
38 Correct 72 ms 39196 KB Output is correct
39 Correct 9 ms 35160 KB Output is correct
40 Correct 53 ms 39000 KB Output is correct
41 Correct 57 ms 39880 KB Output is correct
42 Correct 56 ms 39948 KB Output is correct
43 Correct 94 ms 54868 KB Output is correct
44 Correct 64 ms 47416 KB Output is correct