oj.uz

답안 #239994

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239994 2020-06-17T16:37:01 Z rqi Construction of Highway (JOI18_construction) C++14
16 / 100
 2000 ms 3576 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

/**
 * Description: A set (not multiset!) with support for finding the $n$'th
 * element, and finding the index of an element. Change \texttt{null\_type} for map.
 * Time: O(\log N)
 * Source: KACTL
 * Verification: many
 */

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, 
    rb_tree_tag, tree_order_statistics_node_update>; 
#define ook order_of_key
#define fbo find_by_order

void treeExample() {
    Tree<int> t, t2; t.insert(8);
    auto it = t.insert(10).f; assert(it == t.lb(9));
    assert(t.ook(10) == 1 && t.ook(11) == 2 && *t.fbo(0) == 8);
    t.join(t2); // assuming T < T2 or T > T2, merge t2 into t
}

/**
int atMost(Tree<pi>& T, int r) { 
    return T.ook({r,MOD}); }
int getSum(Tree<pi>& T, int l, int r) { 
    return atMost(T,r)-atMost(T,l-1); }
*/

const int mx = 100005;
int C[mx];
int par[mx];
int main() {
    setIO();
    int N;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> C[i];
    }

    for(int i = 1; i <= N-1; i++){
        int A, B;
        cin >> A >> B;
        par[B] = A;
        Tree<pi> t;
        ll ans = 0;
        int node = B;
        while(node != 1){
            node = par[node];
            t.ins(mp(C[node], node));
            ans+=ll(t.order_of_key(mp(C[node], 0)));
            C[node] = C[B];
        }
        ps(ans);
    }
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

construction.cpp: In function 'void setIn(std::__cxx11::string)':
construction.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
construction.cpp: In function 'void setOut(std::__cxx11::string)':
construction.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 25 ms 384 KB Output is correct
9 Correct 25 ms 384 KB Output is correct
10 Correct 25 ms 512 KB Output is correct
11 Correct 14 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 15 ms 384 KB Output is correct
14 Correct 15 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 16 ms 384 KB Output is correct
20 Correct 15 ms 384 KB Output is correct
21 Correct 15 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 308 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 25 ms 512 KB Output is correct
27 Correct 14 ms 384 KB Output is correct
28 Correct 14 ms 384 KB Output is correct
29 Correct 15 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 15 ms 384 KB Output is correct
33 Correct 9 ms 384 KB Output is correct
34 Correct 9 ms 384 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 10 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 9 ms 384 KB Output is correct
40 Correct 8 ms 384 KB Output is correct
41 Correct 7 ms 384 KB Output is correct
42 Correct 10 ms 384 KB Output is correct
43 Correct 8 ms 384 KB Output is correct
44 Correct 7 ms 512 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 25 ms 384 KB Output is correct
9 Correct 25 ms 384 KB Output is correct
10 Correct 25 ms 512 KB Output is correct
11 Correct 14 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 15 ms 384 KB Output is correct
14 Correct 15 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 16 ms 384 KB Output is correct
20 Correct 15 ms 384 KB Output is correct
21 Correct 15 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 308 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 25 ms 512 KB Output is correct
27 Correct 14 ms 384 KB Output is correct
28 Correct 14 ms 384 KB Output is correct
29 Correct 15 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 15 ms 384 KB Output is correct
33 Correct 9 ms 384 KB Output is correct
34 Correct 9 ms 384 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 10 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 9 ms 384 KB Output is correct
40 Correct 8 ms 384 KB Output is correct
41 Correct 7 ms 384 KB Output is correct
42 Correct 10 ms 384 KB Output is correct
43 Correct 8 ms 384 KB Output is correct
44 Correct 7 ms 512 KB Output is correct
45 Correct 6 ms 384 KB Output is correct
46 Correct 10 ms 512 KB Output is correct
47 Correct 12 ms 512 KB Output is correct
48 Correct 10 ms 512 KB Output is correct
49 Correct 1814 ms 904 KB Output is correct
50 Correct 1810 ms 804 KB Output is correct
51 Correct 1819 ms 872 KB Output is correct
52 Correct 828 ms 632 KB Output is correct
53 Correct 824 ms 724 KB Output is correct
54 Correct 814 ms 632 KB Output is correct
55 Correct 818 ms 944 KB Output is correct
56 Correct 831 ms 704 KB Output is correct
57 Correct 9 ms 512 KB Output is correct
58 Correct 10 ms 512 KB Output is correct
59 Correct 11 ms 512 KB Output is correct
60 Correct 11 ms 512 KB Output is correct
61 Correct 850 ms 772 KB Output is correct
62 Correct 844 ms 672 KB Output is correct
63 Correct 856 ms 636 KB Output is correct
64 Correct 10 ms 512 KB Output is correct
65 Correct 10 ms 384 KB Output is correct
66 Correct 10 ms 512 KB Output is correct
67 Correct 9 ms 512 KB Output is correct
68 Correct 1822 ms 908 KB Output is correct
69 Correct 815 ms 888 KB Output is correct
70 Correct 842 ms 888 KB Output is correct
71 Correct 818 ms 632 KB Output is correct
72 Correct 10 ms 512 KB Output is correct
73 Correct 11 ms 384 KB Output is correct
74 Correct 835 ms 640 KB Output is correct
75 Correct 382 ms 512 KB Output is correct
76 Correct 239 ms 640 KB Output is correct
77 Correct 181 ms 512 KB Output is correct
78 Correct 373 ms 632 KB Output is correct
79 Correct 244 ms 512 KB Output is correct
80 Correct 179 ms 504 KB Output is correct
81 Correct 386 ms 512 KB Output is correct
82 Correct 253 ms 512 KB Output is correct
83 Correct 187 ms 512 KB Output is correct
84 Correct 396 ms 632 KB Output is correct
85 Correct 251 ms 512 KB Output is correct
86 Correct 183 ms 504 KB Output is correct

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 25 ms 384 KB Output is correct
9 Correct 25 ms 384 KB Output is correct
10 Correct 25 ms 512 KB Output is correct
11 Correct 14 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 15 ms 384 KB Output is correct
14 Correct 15 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 16 ms 384 KB Output is correct
20 Correct 15 ms 384 KB Output is correct
21 Correct 15 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 308 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 25 ms 512 KB Output is correct
27 Correct 14 ms 384 KB Output is correct
28 Correct 14 ms 384 KB Output is correct
29 Correct 15 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 15 ms 384 KB Output is correct
33 Correct 9 ms 384 KB Output is correct
34 Correct 9 ms 384 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 10 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 9 ms 384 KB Output is correct
40 Correct 8 ms 384 KB Output is correct
41 Correct 7 ms 384 KB Output is correct
42 Correct 10 ms 384 KB Output is correct
43 Correct 8 ms 384 KB Output is correct
44 Correct 7 ms 512 KB Output is correct
45 Correct 6 ms 384 KB Output is correct
46 Correct 10 ms 512 KB Output is correct
47 Correct 12 ms 512 KB Output is correct
48 Correct 10 ms 512 KB Output is correct
49 Correct 1814 ms 904 KB Output is correct
50 Correct 1810 ms 804 KB Output is correct
51 Correct 1819 ms 872 KB Output is correct
52 Correct 828 ms 632 KB Output is correct
53 Correct 824 ms 724 KB Output is correct
54 Correct 814 ms 632 KB Output is correct
55 Correct 818 ms 944 KB Output is correct
56 Correct 831 ms 704 KB Output is correct
57 Correct 9 ms 512 KB Output is correct
58 Correct 10 ms 512 KB Output is correct
59 Correct 11 ms 512 KB Output is correct
60 Correct 11 ms 512 KB Output is correct
61 Correct 850 ms 772 KB Output is correct
62 Correct 844 ms 672 KB Output is correct
63 Correct 856 ms 636 KB Output is correct
64 Correct 10 ms 512 KB Output is correct
65 Correct 10 ms 384 KB Output is correct
66 Correct 10 ms 512 KB Output is correct
67 Correct 9 ms 512 KB Output is correct
68 Correct 1822 ms 908 KB Output is correct
69 Correct 815 ms 888 KB Output is correct
70 Correct 842 ms 888 KB Output is correct
71 Correct 818 ms 632 KB Output is correct
72 Correct 10 ms 512 KB Output is correct
73 Correct 11 ms 384 KB Output is correct
74 Correct 835 ms 640 KB Output is correct
75 Correct 382 ms 512 KB Output is correct
76 Correct 239 ms 640 KB Output is correct
77 Correct 181 ms 512 KB Output is correct
78 Correct 373 ms 632 KB Output is correct
79 Correct 244 ms 512 KB Output is correct
80 Correct 179 ms 504 KB Output is correct
81 Correct 386 ms 512 KB Output is correct
82 Correct 253 ms 512 KB Output is correct
83 Correct 187 ms 512 KB Output is correct
84 Correct 396 ms 632 KB Output is correct
85 Correct 251 ms 512 KB Output is correct
86 Correct 183 ms 504 KB Output is correct
87 Correct 20 ms 640 KB Output is correct
88 Correct 50 ms 1280 KB Output is correct
89 Correct 199 ms 3576 KB Output is correct
90 Correct 189 ms 3532 KB Output is correct
91 Correct 221 ms 3576 KB Output is correct
92 Execution timed out 2096 ms 2680 KB Time limit exceeded
93 Halted 0 ms 0 KB -