oj.uz

답안 #871237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871237 2023-11-10T09:58:07 Z efedmrlr Logičari (COCI21_logicari) C++17
110 / 110
 179 ms 30548 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e12;
const int N = 1e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
int rt, sp, rtf, spf;
vector<vector<int> > adj;
int par[N];
int dp[N][2][2][2][2];
int vis[N];
bool dfs1(int u, int p) {
    vis[u] = 1;
    for(auto c : adj[u]) {
        if(c == p) continue;
        if(vis[c]) {
            rt = u;
            sp = c;
            for(auto it = adj[rt].begin(); it != adj[rt].end(); it++) {
                if(*it == sp) {
                    adj[rt].erase(it);
                    break;
                }
            }
            for(auto it = adj[sp].begin(); it != adj[sp].end(); it++) {
                if(*it == rt) {
                    adj[sp].erase(it);
                    break;
                }
            }
            return 1;
        }
        if(dfs1(c, u)) {
            return 1;
        }
    }
    return 0;
}
void dfs2(int u, int p) {
    par[u] = p;
    for(auto c : adj[u]) {
        if(c == p) continue;
        dfs2(c, u);
    }
}

int fn(int node, int up, int me) {
    if(node == rt && rtf != me) return INF;
    if(node == sp && spf != me) return INF;
    if(node == sp && rtf == 1 && up == 1) return INF;
    if(dp[node][up][me][rtf][spf] != -1ll) return dp[node][up][me][rtf][spf];
    int sum = 0ll;
    for(auto c : adj[node]) {
        if(c == par[node]) continue;
        sum += fn(c, me, 0ll);
    }
    if(up || (node == sp && rtf == 1) || (node == rt && spf == 1)) {
        return dp[node][up][me][rtf][spf] = min(INF, sum + me);
    }
    int mn = INF;
    for(auto c : adj[node]) {
        if(c == par[node]) continue;
        mn = min(mn , sum + me - fn(c, me, 0ll) + fn(c, me, 1ll));
    }
    return dp[node][up][me][rtf][spf] = mn;

}

inline void solve() {
    cin>>n;
    adj.assign(n+5, vector<int>());
    for(int i = 0; i<n; i++) {
        int u,v;
        cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    
    REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
    dfs1(1, 0);
    dfs2(rt, 0);
    int ans = INF;
    for(int f1 = 0; f1 < 2; f1++) {
        for(int f2 = 0; f2 < 2; f2++) {
            rtf = f1; spf = f2;
            ans = min(fn(rt, 0ll, 0ll), ans);
            ans = min(fn(rt, 0ll, 1ll), ans);
        }
    }
    if(ans == INF) {
        cout<<"-1\n";
        return;
    }
    cout<<ans<<"\n";
}
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:100:5: note: in expansion of macro 'REP'
  100 |     REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
      |     ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:100:16: note: in expansion of macro 'REP'
  100 |     REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
      |                ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:100:25: note: in expansion of macro 'REP'
  100 |     REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
      |                         ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'l' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:100:34: note: in expansion of macro 'REP'
  100 |     REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
      |                                  ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'g' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:100:43: note: in expansion of macro 'REP'
  100 |     REP(i,n+5) REP(j,2) REP(k,2) REP(l,2) REP(g,2) dp[i][j][k][l][g] = -1ll;
      |                                           ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 179 ms 30504 KB Output is correct
6 Correct 135 ms 30548 KB Output is correct
7 Correct 129 ms 30548 KB Output is correct
8 Correct 127 ms 30500 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2512 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 179 ms 30504 KB Output is correct
6 Correct 135 ms 30548 KB Output is correct
7 Correct 129 ms 30548 KB Output is correct
8 Correct 127 ms 30500 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2512 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 98 ms 19796 KB Output is correct
34 Correct 83 ms 20120 KB Output is correct
35 Correct 83 ms 19804 KB Output is correct
36 Correct 84 ms 19888 KB Output is correct
37 Correct 20 ms 6492 KB Output is correct
38 Correct 111 ms 20044 KB Output is correct
39 Correct 6 ms 3320 KB Output is correct
40 Correct 84 ms 19844 KB Output is correct
41 Correct 52 ms 21704 KB Output is correct
42 Correct 90 ms 21824 KB Output is correct
43 Correct 109 ms 30548 KB Output is correct
44 Correct 78 ms 26312 KB Output is correct