oj.uz

답안 #998568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998568 2024-06-14T08:31:34 Z andrei_iorgulescu Newspapers (CEOI21_newspapers) C++14
77 / 100
 44 ms 8272 KB 
#include <bits/stdc++.h>

using namespace std;

int n,m;
vector<int> g[1005],f[1005];
int h[1005];
int hmax[1005];
bool on_diam[1005];

void dfs(int nod,int tata)
{
    hmax[nod] = h[nod];
    for (auto vecin : g[nod])
    {
        if (vecin != tata)
        {
            h[vecin] = 1 + h[nod];
            f[nod].push_back(vecin);
            dfs(vecin,nod);
            hmax[nod] = max(hmax[nod],hmax[vecin]);
        }
    }
}

bool nod_sussy(int x)
{
    for (int i = 1; i <= n; i++)
        f[i].clear();
    h[x] = 0;
    dfs(x,0);
    int cnt = 0;
    for (auto fiu : f[x])
        if (hmax[fiu] >= 3)
            cnt++;
    if (cnt >= 3)
        return true;
    return false;
}

bool viz[1005];
int tatar[1005];

void dfss(int nod)
{
    viz[nod] = true;
    for (auto vecin : g[nod])
        if (!viz[vecin])
            tatar[vecin] = nod,dfss(vecin);
}

int xx,yy,solopt = 1e9;
int bruh;

vector<int> get_path(int x,int y)
{
    memset(viz,0,sizeof(viz));
    memset(tatar,0,sizeof(tatar));
    dfss(x);
    vector<int> diam;
    diam.push_back(y);
    while (y != x)
    {
        y = tatar[y];
        diam.push_back(y);
    }
    return diam;
}

int nrop;
int didi;

void hmm(int nod,int tata)
{
    if (tata != 0 and g[nod].size() == 1)
    {
        if (nrop + 2 * didi - 4 < solopt)
        {
            solopt = nrop + 2 * didi - 4;
            xx = nod;
            yy = bruh;
        }
    }
    int cntt = 0;
    for (auto it : f[nod])
        if (hmax[it] - h[it] >= 2)
            cntt++;
    if (cntt >= 2)
        return;
    if (cntt == 1)
    {
        for (auto it : f[nod])
            if (hmax[it] - h[it] < 2)
                nrop += 4;
        for (auto it : f[nod])
            if (hmax[it] - h[it] >= 2)
            {
                didi++;
                hmm(it,nod);
                didi--;
            }
        for (auto it : f[nod])
            if (hmax[it] - h[it] < 2)
                nrop -= 4;
    }
    else
    {
        nrop += 4 * (int)f[nod].size() - 4;
        for (auto it : f[nod])
        {
            didi++;
            hmm(it,nod);
            didi--;
        }
        nrop -= (4 * (int)f[nod].size() - 4);
    }
}

void hoosh(int nod)
{
    for (int i = 1; i <= n; i++)
        f[i].clear();
    h[nod] = 0;
    dfs(nod,0);
    hmm(nod,0);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    if (m != n - 1)
    {
        cout << "NO";
        return 0;
    }
    for (int i = 1; i <= n; i++)
    {
        if (nod_sussy(i))
        {
            cout << "NO";
            return 0;
        }
    }
    if (n == 1 or n == 2)
    {
        cout << "YES\n";
        cout << n << '\n';
        for (int i = 1; i <= n; i++)
            cout << 1 << ' ';
        return 0;
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++)
    {
        bruh = i;
        if (g[i].size() == 1)
        {
            hoosh(i);
        }
    }
    vector<int> op;
    vector<int> diam = get_path(xx,yy);
    for (auto it : diam)
        on_diam[it] = true;
    //op.push_back(diam[1]);
    for (int i = 1; i < diam.size() - 1; i++)
    {
        op.push_back(diam[i]);
        for (auto it : g[diam[i]])
            if (!on_diam[it] and g[it].size() > 1)
                op.push_back(it),op.push_back(diam[i]);
    }
    if (op.size() % 2 == 0)
        reverse(diam.begin(),diam.end());
    //op.push_back(diam[1]);
    for (int i = 1; i < diam.size() - 1; i++)
    {
        op.push_back(diam[i]);
        for (auto it : g[diam[i]])
            if (!on_diam[it] and g[it].size() > 1)
                op.push_back(it),op.push_back(diam[i]);
    }
    cout << op.size() << '\n';
    for (auto it : op)
        cout << it << ' ';
    return 0;
}

///wtf why does that even work ???
/**
constructie (nush cat de optima dar e o idee)
imi iau diamnetrul
din fiecare punct de pe el pot rasari maxim arbori de inaltime 2 (gen, fiu al diametrului + fiii lui care sunt frunze)
Fie nodurile de pe diametru d[1], d[2], ..., d[k]
Dau initial pe d[2]
Procesul e gen: daca am reusit sa ma asigur ca nu am in candidati toti vecinii lui d[x] in afara de d[x + 1], dau pe d[x + 1]
Daca am dat pe d[x + 1] si tin nodul d[x] alternant, mi se garanteaza inductiv ca de acum aia gen d[i <= x] si chestiile care rasar sunt alternante
Acum, sa zicem ca un sufix din vecinii (nu de pe diametru) ai lui d[x] sunt activi
Il iau pe primul si dau pe el, apoi dau pe 3
Apoi aproximativ repet aceeasi secventa de operatii ca o sa mearga
**/

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:176:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  176 |     for (int i = 1; i < diam.size() - 1; i++)
      |                     ~~^~~~~~~~~~~~~~~~~
newspapers.cpp:186:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |     for (int i = 1; i < diam.size() - 1; i++)
      |                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 504 KB Provide a successful but not optimal strategy.
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
20 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
21 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 504 KB Provide a successful but not optimal strategy.
23 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
24 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
25 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
26 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
27 Correct 0 ms 348 KB Output is correct
28 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
31 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
33 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
34 Correct 0 ms 348 KB Output is correct
35 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
36 Correct 0 ms 348 KB Output is correct
37 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
38 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
39 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
40 Partially correct 1 ms 500 KB Provide a successful but not optimal strategy.
41 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
43 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
44 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 508 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 10 ms 580 KB Output is correct
17 Correct 10 ms 604 KB Output is correct
18 Correct 10 ms 600 KB Output is correct
19 Correct 10 ms 600 KB Output is correct
20 Correct 10 ms 600 KB Output is correct

Subtask #3
60.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 504 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 504 KB Provide a successful but not optimal strategy.
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
20 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
21 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 504 KB Provide a successful but not optimal strategy.
23 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
24 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
25 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
26 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
27 Correct 0 ms 348 KB Output is correct
28 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
31 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
33 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
34 Correct 0 ms 348 KB Output is correct
35 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
36 Correct 0 ms 348 KB Output is correct
37 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
38 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
39 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
40 Partially correct 1 ms 500 KB Provide a successful but not optimal strategy.
41 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
43 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
44 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 508 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 508 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 14 ms 624 KB Output is correct
90 Correct 11 ms 604 KB Output is correct
91 Correct 11 ms 604 KB Output is correct
92 Correct 9 ms 604 KB Output is correct
93 Correct 13 ms 628 KB Output is correct
94 Partially correct 13 ms 600 KB Provide a successful but not optimal strategy.
95 Partially correct 15 ms 604 KB Provide a successful but not optimal strategy.
96 Partially correct 14 ms 604 KB Provide a successful but not optimal strategy.
97 Partially correct 9 ms 600 KB Provide a successful but not optimal strategy.
98 Correct 14 ms 600 KB Output is correct
99 Partially correct 11 ms 604 KB Provide a successful but not optimal strategy.
100 Correct 11 ms 604 KB Output is correct
101 Correct 11 ms 600 KB Output is correct
102 Correct 11 ms 600 KB Output is correct
103 Correct 12 ms 604 KB Output is correct
104 Partially correct 8 ms 604 KB Provide a successful but not optimal strategy.
105 Partially correct 10 ms 604 KB Provide a successful but not optimal strategy.
106 Partially correct 12 ms 612 KB Provide a successful but not optimal strategy.
107 Correct 10 ms 600 KB Output is correct
108 Partially correct 14 ms 612 KB Provide a successful but not optimal strategy.
109 Partially correct 11 ms 604 KB Provide a successful but not optimal strategy.
110 Partially correct 11 ms 600 KB Provide a successful but not optimal strategy.
111 Partially correct 9 ms 604 KB Provide a successful but not optimal strategy.
112 Correct 9 ms 604 KB Output is correct
113 Partially correct 14 ms 604 KB Provide a successful but not optimal strategy.
114 Correct 13 ms 604 KB Output is correct
115 Correct 10 ms 600 KB Output is correct
116 Partially correct 12 ms 600 KB Provide a successful but not optimal strategy.
117 Partially correct 15 ms 604 KB Provide a successful but not optimal strategy.
118 Partially correct 13 ms 612 KB Provide a successful but not optimal strategy.
119 Partially correct 11 ms 608 KB Provide a successful but not optimal strategy.
120 Partially correct 13 ms 604 KB Provide a successful but not optimal strategy.
121 Correct 13 ms 604 KB Output is correct
122 Partially correct 10 ms 604 KB Provide a successful but not optimal strategy.
123 Correct 9 ms 600 KB Output is correct
124 Correct 14 ms 604 KB Output is correct
125 Partially correct 9 ms 604 KB Provide a successful but not optimal strategy.
126 Partially correct 10 ms 604 KB Provide a successful but not optimal strategy.
127 Partially correct 9 ms 604 KB Provide a successful but not optimal strategy.
128 Partially correct 14 ms 604 KB Provide a successful but not optimal strategy.
129 Correct 0 ms 348 KB Output is correct
130 Correct 1 ms 348 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 1 ms 348 KB Output is correct
133 Correct 0 ms 348 KB Output is correct
134 Correct 9 ms 2140 KB Output is correct
135 Correct 8 ms 2140 KB Output is correct
136 Correct 23 ms 5632 KB Output is correct
137 Correct 13 ms 3420 KB Output is correct
138 Correct 23 ms 4688 KB Output is correct
139 Correct 42 ms 8016 KB Output is correct
140 Correct 6 ms 1624 KB Output is correct
141 Correct 2 ms 860 KB Output is correct
142 Correct 39 ms 7508 KB Output is correct
143 Correct 44 ms 8272 KB Output is correct
144 Correct 13 ms 604 KB Output is correct
145 Correct 10 ms 600 KB Output is correct