oj.uz

답안 #886212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886212 2023-12-11T15:13:43 Z Kutan Magic Tree (CEOI19_magictree) C++14
58 / 100
 95 ms 27228 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 1e5 + 5;

int n, m, k, par[N];
int d[N], w[N] = {};
vi adj[N];
bool sub2 = 1;

void readip(){
    cin >> n >> m >> k;
    REP(i, 2, n) {
        cin >> par[i];
        adj[par[i]].eb(i);
    }
    REP(i, 1, m) {
        int v; cin >> v;
        cin >> d[v] >> w[v];
        if (!adj[v].empty()) sub2 = false;
    }
}

namespace sub1{
    multiset<int> s[N];
    void dfs_tree(int u) {
        for (int v : adj[u]) {
            dfs_tree(v);
            if (s[v].size() > s[u].size()) 
                swap(s[u], s[v]);
            for (int x : s[v]) s[u].insert(x);
        }
        if (w[u] == 0) return;
        auto it = s[u].upper_bound(d[u]);
        if (it != s[u].end()) s[u].erase(it);
        s[u].insert(d[u]);
    }

    void solve() {
        dfs_tree(1);
        cout << s[1].size();
    }
};

void solve(){   
    int maxw = 0;
    REP(i, 1, n) maximize(maxw, w[i]);
    if (maxw <= 1) {
        sub1::solve();
        return;
    }

    if (sub2) {
        ll res = 0;
        REP(i, 1, n) res += w[i];
        cout << res << ln;
        return;
    }
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

magictree.cpp: In function 'void readip()':
magictree.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
magictree.cpp:146:5: note: in expansion of macro 'REP'
  146 |     REP(i, 2, n) {
      |     ^~~
magictree.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
magictree.cpp:150:5: note: in expansion of macro 'REP'
  150 |     REP(i, 1, m) {
      |     ^~~
magictree.cpp: In function 'void solve()':
magictree.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
magictree.cpp:180:5: note: in expansion of macro 'REP'
  180 |     REP(i, 1, n) maximize(maxw, w[i]);
      |     ^~~
magictree.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
magictree.cpp:188:9: note: in expansion of macro 'REP'
  188 |         REP(i, 1, n) res += w[i];
      |         ^~~
magictree.cpp: In function 'void file()':
magictree.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 10076 KB Output is correct
2 Correct 16 ms 11356 KB Output is correct
3 Correct 28 ms 11636 KB Output is correct
4 Correct 26 ms 11116 KB Output is correct
5 Correct 28 ms 11604 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7516 KB Output is correct
4 Correct 38 ms 22616 KB Output is correct
5 Correct 56 ms 27228 KB Output is correct
6 Correct 48 ms 22708 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 10076 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 95 ms 25556 KB Output is correct
11 Correct 85 ms 25984 KB Output is correct
12 Correct 77 ms 17748 KB Output is correct
13 Correct 45 ms 17308 KB Output is correct
14 Correct 46 ms 22804 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 8024 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 38 ms 22616 KB Output is correct
14 Correct 56 ms 27228 KB Output is correct
15 Correct 48 ms 22708 KB Output is correct
16 Correct 95 ms 25556 KB Output is correct
17 Correct 85 ms 25984 KB Output is correct
18 Correct 77 ms 17748 KB Output is correct
19 Correct 45 ms 17308 KB Output is correct
20 Correct 46 ms 22804 KB Output is correct
21 Correct 17 ms 10640 KB Output is correct
22 Correct 50 ms 19024 KB Output is correct
23 Correct 55 ms 18888 KB Output is correct
24 Correct 84 ms 25172 KB Output is correct
25 Correct 56 ms 17364 KB Output is correct
26 Correct 69 ms 18488 KB Output is correct
27 Correct 54 ms 17676 KB Output is correct

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7512 KB Output is correct
2 Correct 2 ms 7516 KB Output is correct
3 Correct 2 ms 7512 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7516 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 17 ms 10076 KB Output is correct
11 Correct 16 ms 11356 KB Output is correct
12 Correct 28 ms 11636 KB Output is correct
13 Correct 26 ms 11116 KB Output is correct
14 Correct 28 ms 11604 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Correct 2 ms 7516 KB Output is correct
17 Correct 2 ms 7516 KB Output is correct
18 Correct 38 ms 22616 KB Output is correct
19 Correct 56 ms 27228 KB Output is correct
20 Correct 48 ms 22708 KB Output is correct
21 Incorrect 37 ms 10076 KB Output isn't correct
22 Halted 0 ms 0 KB -