oj.uz

답안 #751892

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751892 2023-06-01T17:34:02 Z Sam_a17 도로 폐쇄 (APIO21_roads) C++17
100 / 100
 506 ms 105616 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  } else {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10;
vector<int> d[N];
vector<pair<int, long long>> adj[N], adj2[N];
int n, deg[N], can[N];
long long sub, dp[N][2];
bool active[N], vis[N];
vector<int> curr;
int cnt = 0;

struct segTree {
  struct node {
    long long sum, cnt;
  };
  vector<node> mTree;
  int size;
 
  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, {0, 0});
  }

  node combine(node a, node b) {
    node c;
    c.sum = a.sum + b.sum;
    c.cnt = a.cnt + b.cnt;
    return c;
  }
 
  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      if(v == 0) {
        mTree[x] = {0, 0};
      } else {
        mTree[x] = {v, 1};
      }
      return;
    }
 
    int m = (lx + rx) / 2;
    if(u < m) {
      upd(u, v, 2 * x + 1, lx, m);
    }else {
      upd(u, v, 2 * x + 2, m, rx);
    }
    mTree[x] = combine(mTree[2 * x + 1], mTree[2 * x + 2]);
  }
 
  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }

  long long get(int need, int x, int lx, int rx) {
    if(rx - lx == 1) {
      return mTree[x].sum;
    }

    int mid = (lx + rx) / 2;
    if(mTree[2 * x + 1].cnt == need) {
      return mTree[2 * x + 1].sum;
    }

    if(mTree[2 * x + 1].cnt > need) {
      return get(need, 2 * x + 1, lx, mid);
    } else {
      return mTree[2 * x + 1].sum + get(need - mTree[2 * x + 1].cnt, 2 * x + 2, mid, rx);
    }
  }
 
  long long get(int need) {
    if(need == 0) {
      return 0;
    }
    if(mTree[0].cnt < need) {
      return -1;
    }

    if(mTree[0].cnt == need) {
      return mTree[0].sum;
    }

    return get(need, 0, 0, size);
  }
} seg[N];
 
 
void dfs(int node, int parent, int max_deg) {
  int cnt = 0;
  vis[node] = true;
  for(auto i: adj2[node]) {
    if(i.first == parent) continue;
    dfs(i.first, node, max_deg);
  }
 
  vector<pair<long long, long long>> diff;
  for(auto i: adj2[node]) {
    if(i.first == parent) continue;
    diff.push_back({dp[i.first][1] + i.second - dp[i.first][0], i.first});
  }
  sort(all(diff));

  
  int curr_deg = deg[node];
  {
    int qn = curr_deg - max_deg;
    long long to_add = 0, cr = 0; 
    vector<pair<long long, long long>> nd;
    for(int i = 0; i < sz(diff); i++) {
      if(diff[i].first < 0) {
        to_add += diff[i].first + dp[diff[i].second][0];
        cr++;
      } else {
        nd.push_back({diff[i].first + dp[diff[i].second][0], dp[diff[i].second][0]});
        to_add += dp[diff[i].second][0];
      }
    }

    if(cr >= qn) {
      dp[node][0] = to_add;
    } else {
      long long an = qn - cr, qi = seg[node].get(an);

      assert(sz(diff) + seg[node].mTree[0].cnt >= max_deg);
      if(qi != -1) {
        dp[node][0] = to_add + qi;
      } else {
        dp[node][0] = INT64_MAX / 10;
      }

      for(auto i: nd) {
        to_add += i.first;
        to_add -= i.second;
        an--;
        qi = seg[node].get(an);

        if(qi != -1) {
          dp[node][0] = min(dp[node][0], to_add + qi);
        } 
      }

    }
  }

  {
    int qn = curr_deg - max_deg - 1;
    long long to_add = 0, cr = 0; 
    vector<pair<long long, long long>> nd;
    for(int i = 0; i < sz(diff); i++) {
      if(diff[i].first < 0) {
        to_add += diff[i].first + dp[diff[i].second][0];
        cr++;
      } else {
        nd.push_back({diff[i].first + dp[diff[i].second][0], dp[diff[i].second][0]});
        to_add += dp[diff[i].second][0];
      }
    }

    if(cr >= qn) {
      dp[node][1] = to_add;
    } else {
      long long an = qn - cr, qi = seg[node].get(an);
      if(qi != -1) {
        dp[node][1] = to_add + qi;
      } else {
        dp[node][1] = INT64_MAX / 10;
      }

      for(auto i: nd) {
        to_add += i.first;
        to_add -= i.second;
        an--;
        qi = seg[node].get(an);
        if(qi != -1) {
          dp[node][1] = min(dp[node][1], to_add + qi);
        }
      }
    }

    dp[node][0] = max(dp[node][0], dp[node][1]);
    assert(dp[node][0] >= dp[node][1]);
  }
}

bool cmp(pair<long long, long long> x, pair<long long, long long> y) {
  return x.second < y.second;
}

map<pair<int, int>, int> mp[N];

map<pair<int, int>, int> mpil;

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
  n = N;
 
  for(int i = 0; i < n - 1; i++) {
    // U[i]--, V[i]--;
    adj[U[i]].emplace_back(V[i], W[i]);
    adj[V[i]].emplace_back(U[i], W[i]);
    deg[U[i]]++, deg[V[i]]++;
  }
 
  for(int i = 0; i < n; i++) {
    d[deg[i]].push_back(i);
    sort(all(adj[i]), cmp);
    seg[i].init(deg[i] + 1);
    int it = 0;
    for(auto j: adj[i]) {
      seg[i].upd(it, j.second);
      mp[i][j] = it;
      it++;
    }
  }

  vector<long long> ans(n, 0);
  for(int i = n - 2; i >= 0; i--) {
    for(auto j: d[i + 1]) {
      active[j] = true;
      curr.push_back(j);
    }
 
    for(auto j: d[i + 1]) {
      for(auto k: adj[j]) {
        if(active[k.first]) {

          if(!mpil[{j, k.first}]) {
            adj2[k.first].emplace_back(j, k.second);

            assert(mp[k.first].find({j, k.second}) != mp[k.first].end());
            auto it = mp[k.first][{j, k.second}];

            seg[k.first].upd(it, 0);

            adj2[j].emplace_back(k.first, k.second);

            assert(mp[j].find({k.first, k.second}) != mp[j].end());
            it = mp[j][{k.first, k.second}];
            seg[j].upd(it, 0);

            mpil[{j, k.first}] = 1;
            mpil[{k.first, j}] = 1;
          }
        }
      }
    }

    for(auto j: curr) {
      dp[j][0] = dp[j][1] = INT64_MAX / 10;
      vis[j] = false;
    }
  
    for(auto j: curr) {
      if(!vis[j]) {
        // assert(j == 0);
        dfs(j, -1, i);
        ans[i] += dp[j][0];
      }
    }
  }
 
  return ans;
}

Compilation message

roads.cpp: In function 'void dfs(int, int, int)':
roads.cpp:168:7: warning: unused variable 'cnt' [-Wunused-variable]
  168 |   int cnt = 0;
      |       ^~~
roads.cpp: In function 'void setIO(std::string)':
roads.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
roads.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
roads.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
roads.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 30036 KB Output is correct
2 Correct 21 ms 31120 KB Output is correct
3 Correct 24 ms 31188 KB Output is correct
4 Correct 25 ms 31084 KB Output is correct
5 Correct 22 ms 30036 KB Output is correct
6 Correct 19 ms 30184 KB Output is correct
7 Correct 18 ms 30164 KB Output is correct
8 Correct 22 ms 31004 KB Output is correct
9 Correct 23 ms 31084 KB Output is correct
10 Correct 23 ms 30180 KB Output is correct
11 Correct 20 ms 30152 KB Output is correct
12 Correct 211 ms 62380 KB Output is correct
13 Correct 393 ms 84980 KB Output is correct
14 Correct 371 ms 80344 KB Output is correct
15 Correct 364 ms 85052 KB Output is correct
16 Correct 360 ms 85752 KB Output is correct
17 Correct 354 ms 85848 KB Output is correct
18 Correct 18 ms 30056 KB Output is correct
19 Correct 303 ms 80400 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 30008 KB Output is correct
2 Correct 196 ms 91308 KB Output is correct
3 Correct 232 ms 98916 KB Output is correct
4 Correct 216 ms 103664 KB Output is correct
5 Correct 232 ms 103768 KB Output is correct
6 Correct 23 ms 31348 KB Output is correct
7 Correct 20 ms 31572 KB Output is correct
8 Correct 20 ms 31376 KB Output is correct
9 Correct 17 ms 30088 KB Output is correct
10 Correct 18 ms 30164 KB Output is correct
11 Correct 17 ms 30172 KB Output is correct
12 Correct 139 ms 74224 KB Output is correct
13 Correct 210 ms 103620 KB Output is correct
14 Correct 18 ms 29960 KB Output is correct
15 Correct 202 ms 96380 KB Output is correct
16 Correct 213 ms 103832 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 30036 KB Output is correct
2 Correct 17 ms 30052 KB Output is correct
3 Correct 18 ms 30036 KB Output is correct
4 Correct 17 ms 30036 KB Output is correct
5 Correct 17 ms 30060 KB Output is correct
6 Correct 18 ms 30092 KB Output is correct
7 Correct 17 ms 30056 KB Output is correct
8 Correct 22 ms 30152 KB Output is correct
9 Correct 17 ms 30080 KB Output is correct
10 Correct 22 ms 30128 KB Output is correct
11 Correct 18 ms 30128 KB Output is correct
12 Correct 19 ms 30128 KB Output is correct
13 Correct 18 ms 30104 KB Output is correct
14 Correct 22 ms 30080 KB Output is correct
15 Correct 18 ms 30108 KB Output is correct
16 Correct 17 ms 30036 KB Output is correct
17 Correct 22 ms 30168 KB Output is correct
18 Correct 20 ms 30052 KB Output is correct
19 Correct 21 ms 30164 KB Output is correct
20 Correct 17 ms 30060 KB Output is correct
21 Correct 17 ms 30024 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 30036 KB Output is correct
2 Correct 17 ms 30052 KB Output is correct
3 Correct 18 ms 30036 KB Output is correct
4 Correct 17 ms 30036 KB Output is correct
5 Correct 17 ms 30060 KB Output is correct
6 Correct 18 ms 30092 KB Output is correct
7 Correct 17 ms 30056 KB Output is correct
8 Correct 22 ms 30152 KB Output is correct
9 Correct 17 ms 30080 KB Output is correct
10 Correct 22 ms 30128 KB Output is correct
11 Correct 18 ms 30128 KB Output is correct
12 Correct 19 ms 30128 KB Output is correct
13 Correct 18 ms 30104 KB Output is correct
14 Correct 22 ms 30080 KB Output is correct
15 Correct 18 ms 30108 KB Output is correct
16 Correct 17 ms 30036 KB Output is correct
17 Correct 22 ms 30168 KB Output is correct
18 Correct 20 ms 30052 KB Output is correct
19 Correct 21 ms 30164 KB Output is correct
20 Correct 17 ms 30060 KB Output is correct
21 Correct 17 ms 30024 KB Output is correct
22 Correct 20 ms 30036 KB Output is correct
23 Correct 19 ms 30708 KB Output is correct
24 Correct 21 ms 31112 KB Output is correct
25 Correct 22 ms 30948 KB Output is correct
26 Correct 23 ms 31108 KB Output is correct
27 Correct 20 ms 31188 KB Output is correct
28 Correct 24 ms 31124 KB Output is correct
29 Correct 21 ms 31004 KB Output is correct
30 Correct 21 ms 31144 KB Output is correct
31 Correct 25 ms 31120 KB Output is correct
32 Correct 22 ms 31120 KB Output is correct
33 Correct 26 ms 31328 KB Output is correct
34 Correct 22 ms 31500 KB Output is correct
35 Correct 25 ms 31304 KB Output is correct
36 Correct 23 ms 31116 KB Output is correct
37 Correct 25 ms 31188 KB Output is correct
38 Correct 21 ms 31180 KB Output is correct
39 Correct 20 ms 30036 KB Output is correct
40 Correct 20 ms 29992 KB Output is correct
41 Correct 21 ms 30036 KB Output is correct
42 Correct 21 ms 30184 KB Output is correct
43 Correct 17 ms 30136 KB Output is correct
44 Correct 21 ms 30036 KB Output is correct
45 Correct 20 ms 30076 KB Output is correct
46 Correct 21 ms 30184 KB Output is correct
47 Correct 21 ms 30168 KB Output is correct
48 Correct 16 ms 30208 KB Output is correct
49 Correct 16 ms 30184 KB Output is correct
50 Correct 16 ms 30036 KB Output is correct
51 Correct 16 ms 30172 KB Output is correct
52 Correct 20 ms 30100 KB Output is correct
53 Correct 22 ms 30816 KB Output is correct
54 Correct 20 ms 31124 KB Output is correct
55 Correct 22 ms 31088 KB Output is correct
56 Correct 20 ms 30964 KB Output is correct
57 Correct 22 ms 31052 KB Output is correct
58 Correct 17 ms 30024 KB Output is correct
59 Correct 17 ms 30064 KB Output is correct
60 Correct 21 ms 30060 KB Output is correct
61 Correct 18 ms 30164 KB Output is correct
62 Correct 18 ms 30156 KB Output is correct
63 Correct 17 ms 30036 KB Output is correct
64 Correct 25 ms 31012 KB Output is correct
65 Correct 20 ms 31060 KB Output is correct
66 Correct 24 ms 31056 KB Output is correct
67 Correct 21 ms 31088 KB Output is correct
68 Correct 21 ms 31060 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 459 ms 81364 KB Output is correct
2 Correct 456 ms 81396 KB Output is correct
3 Correct 406 ms 84988 KB Output is correct
4 Correct 493 ms 83868 KB Output is correct
5 Correct 408 ms 85184 KB Output is correct
6 Correct 366 ms 81492 KB Output is correct
7 Correct 476 ms 84508 KB Output is correct
8 Correct 313 ms 81668 KB Output is correct
9 Correct 404 ms 87664 KB Output is correct
10 Correct 506 ms 82508 KB Output is correct
11 Correct 399 ms 84020 KB Output is correct
12 Correct 359 ms 83856 KB Output is correct
13 Correct 16 ms 29956 KB Output is correct
14 Correct 183 ms 97352 KB Output is correct
15 Correct 236 ms 104708 KB Output is correct
16 Correct 21 ms 31060 KB Output is correct
17 Correct 22 ms 31092 KB Output is correct
18 Correct 22 ms 31076 KB Output is correct
19 Correct 22 ms 31120 KB Output is correct
20 Correct 20 ms 31104 KB Output is correct
21 Correct 339 ms 80432 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 459 ms 81364 KB Output is correct
2 Correct 456 ms 81396 KB Output is correct
3 Correct 406 ms 84988 KB Output is correct
4 Correct 493 ms 83868 KB Output is correct
5 Correct 408 ms 85184 KB Output is correct
6 Correct 366 ms 81492 KB Output is correct
7 Correct 476 ms 84508 KB Output is correct
8 Correct 313 ms 81668 KB Output is correct
9 Correct 404 ms 87664 KB Output is correct
10 Correct 506 ms 82508 KB Output is correct
11 Correct 399 ms 84020 KB Output is correct
12 Correct 359 ms 83856 KB Output is correct
13 Correct 16 ms 29956 KB Output is correct
14 Correct 183 ms 97352 KB Output is correct
15 Correct 236 ms 104708 KB Output is correct
16 Correct 21 ms 31060 KB Output is correct
17 Correct 22 ms 31092 KB Output is correct
18 Correct 22 ms 31076 KB Output is correct
19 Correct 22 ms 31120 KB Output is correct
20 Correct 20 ms 31104 KB Output is correct
21 Correct 339 ms 80432 KB Output is correct
22 Correct 20 ms 29948 KB Output is correct
23 Correct 16 ms 30056 KB Output is correct
24 Correct 16 ms 30036 KB Output is correct
25 Correct 387 ms 76336 KB Output is correct
26 Correct 373 ms 71848 KB Output is correct
27 Correct 439 ms 84156 KB Output is correct
28 Correct 387 ms 85196 KB Output is correct
29 Correct 409 ms 80908 KB Output is correct
30 Correct 407 ms 79536 KB Output is correct
31 Correct 370 ms 82372 KB Output is correct
32 Correct 452 ms 79500 KB Output is correct
33 Correct 332 ms 82684 KB Output is correct
34 Correct 423 ms 84576 KB Output is correct
35 Correct 405 ms 90648 KB Output is correct
36 Correct 419 ms 84008 KB Output is correct
37 Correct 330 ms 84040 KB Output is correct
38 Correct 159 ms 74860 KB Output is correct
39 Correct 211 ms 104768 KB Output is correct
40 Correct 18 ms 30832 KB Output is correct
41 Correct 26 ms 31048 KB Output is correct
42 Correct 28 ms 31084 KB Output is correct
43 Correct 21 ms 31028 KB Output is correct
44 Correct 22 ms 31072 KB Output is correct
45 Correct 16 ms 30076 KB Output is correct
46 Correct 16 ms 30164 KB Output is correct
47 Correct 16 ms 30164 KB Output is correct
48 Correct 17 ms 30128 KB Output is correct
49 Correct 19 ms 30184 KB Output is correct
50 Correct 200 ms 62296 KB Output is correct
51 Correct 351 ms 84920 KB Output is correct
52 Correct 383 ms 82276 KB Output is correct
53 Correct 430 ms 81328 KB Output is correct
54 Correct 385 ms 85188 KB Output is correct
55 Correct 391 ms 83932 KB Output is correct
56 Correct 366 ms 85220 KB Output is correct
57 Correct 343 ms 81560 KB Output is correct
58 Correct 417 ms 84688 KB Output is correct
59 Correct 293 ms 81596 KB Output is correct
60 Correct 375 ms 87764 KB Output is correct
61 Correct 408 ms 82484 KB Output is correct
62 Correct 414 ms 83996 KB Output is correct
63 Correct 331 ms 83912 KB Output is correct
64 Correct 17 ms 29980 KB Output is correct
65 Correct 187 ms 97308 KB Output is correct
66 Correct 195 ms 104804 KB Output is correct
67 Correct 20 ms 31060 KB Output is correct
68 Correct 23 ms 31156 KB Output is correct
69 Correct 26 ms 31032 KB Output is correct
70 Correct 21 ms 31092 KB Output is correct
71 Correct 20 ms 31116 KB Output is correct
72 Correct 279 ms 80380 KB Output is correct

Subtask #7
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 30036 KB Output is correct
2 Correct 21 ms 31120 KB Output is correct
3 Correct 24 ms 31188 KB Output is correct
4 Correct 25 ms 31084 KB Output is correct
5 Correct 22 ms 30036 KB Output is correct
6 Correct 19 ms 30184 KB Output is correct
7 Correct 18 ms 30164 KB Output is correct
8 Correct 22 ms 31004 KB Output is correct
9 Correct 23 ms 31084 KB Output is correct
10 Correct 23 ms 30180 KB Output is correct
11 Correct 20 ms 30152 KB Output is correct
12 Correct 211 ms 62380 KB Output is correct
13 Correct 393 ms 84980 KB Output is correct
14 Correct 371 ms 80344 KB Output is correct
15 Correct 364 ms 85052 KB Output is correct
16 Correct 360 ms 85752 KB Output is correct
17 Correct 354 ms 85848 KB Output is correct
18 Correct 18 ms 30056 KB Output is correct
19 Correct 303 ms 80400 KB Output is correct
20 Correct 17 ms 30008 KB Output is correct
21 Correct 196 ms 91308 KB Output is correct
22 Correct 232 ms 98916 KB Output is correct
23 Correct 216 ms 103664 KB Output is correct
24 Correct 232 ms 103768 KB Output is correct
25 Correct 23 ms 31348 KB Output is correct
26 Correct 20 ms 31572 KB Output is correct
27 Correct 20 ms 31376 KB Output is correct
28 Correct 17 ms 30088 KB Output is correct
29 Correct 18 ms 30164 KB Output is correct
30 Correct 17 ms 30172 KB Output is correct
31 Correct 139 ms 74224 KB Output is correct
32 Correct 210 ms 103620 KB Output is correct
33 Correct 18 ms 29960 KB Output is correct
34 Correct 202 ms 96380 KB Output is correct
35 Correct 213 ms 103832 KB Output is correct
36 Correct 17 ms 30036 KB Output is correct
37 Correct 17 ms 30052 KB Output is correct
38 Correct 18 ms 30036 KB Output is correct
39 Correct 17 ms 30036 KB Output is correct
40 Correct 17 ms 30060 KB Output is correct
41 Correct 18 ms 30092 KB Output is correct
42 Correct 17 ms 30056 KB Output is correct
43 Correct 22 ms 30152 KB Output is correct
44 Correct 17 ms 30080 KB Output is correct
45 Correct 22 ms 30128 KB Output is correct
46 Correct 18 ms 30128 KB Output is correct
47 Correct 19 ms 30128 KB Output is correct
48 Correct 18 ms 30104 KB Output is correct
49 Correct 22 ms 30080 KB Output is correct
50 Correct 18 ms 30108 KB Output is correct
51 Correct 17 ms 30036 KB Output is correct
52 Correct 22 ms 30168 KB Output is correct
53 Correct 20 ms 30052 KB Output is correct
54 Correct 21 ms 30164 KB Output is correct
55 Correct 17 ms 30060 KB Output is correct
56 Correct 17 ms 30024 KB Output is correct
57 Correct 20 ms 30036 KB Output is correct
58 Correct 19 ms 30708 KB Output is correct
59 Correct 21 ms 31112 KB Output is correct
60 Correct 22 ms 30948 KB Output is correct
61 Correct 23 ms 31108 KB Output is correct
62 Correct 20 ms 31188 KB Output is correct
63 Correct 24 ms 31124 KB Output is correct
64 Correct 21 ms 31004 KB Output is correct
65 Correct 21 ms 31144 KB Output is correct
66 Correct 25 ms 31120 KB Output is correct
67 Correct 22 ms 31120 KB Output is correct
68 Correct 26 ms 31328 KB Output is correct
69 Correct 22 ms 31500 KB Output is correct
70 Correct 25 ms 31304 KB Output is correct
71 Correct 23 ms 31116 KB Output is correct
72 Correct 25 ms 31188 KB Output is correct
73 Correct 21 ms 31180 KB Output is correct
74 Correct 20 ms 30036 KB Output is correct
75 Correct 20 ms 29992 KB Output is correct
76 Correct 21 ms 30036 KB Output is correct
77 Correct 21 ms 30184 KB Output is correct
78 Correct 17 ms 30136 KB Output is correct
79 Correct 21 ms 30036 KB Output is correct
80 Correct 20 ms 30076 KB Output is correct
81 Correct 21 ms 30184 KB Output is correct
82 Correct 21 ms 30168 KB Output is correct
83 Correct 16 ms 30208 KB Output is correct
84 Correct 16 ms 30184 KB Output is correct
85 Correct 16 ms 30036 KB Output is correct
86 Correct 16 ms 30172 KB Output is correct
87 Correct 20 ms 30100 KB Output is correct
88 Correct 22 ms 30816 KB Output is correct
89 Correct 20 ms 31124 KB Output is correct
90 Correct 22 ms 31088 KB Output is correct
91 Correct 20 ms 30964 KB Output is correct
92 Correct 22 ms 31052 KB Output is correct
93 Correct 17 ms 30024 KB Output is correct
94 Correct 17 ms 30064 KB Output is correct
95 Correct 21 ms 30060 KB Output is correct
96 Correct 18 ms 30164 KB Output is correct
97 Correct 18 ms 30156 KB Output is correct
98 Correct 17 ms 30036 KB Output is correct
99 Correct 25 ms 31012 KB Output is correct
100 Correct 20 ms 31060 KB Output is correct
101 Correct 24 ms 31056 KB Output is correct
102 Correct 21 ms 31088 KB Output is correct
103 Correct 21 ms 31060 KB Output is correct
104 Correct 459 ms 81364 KB Output is correct
105 Correct 456 ms 81396 KB Output is correct
106 Correct 406 ms 84988 KB Output is correct
107 Correct 493 ms 83868 KB Output is correct
108 Correct 408 ms 85184 KB Output is correct
109 Correct 366 ms 81492 KB Output is correct
110 Correct 476 ms 84508 KB Output is correct
111 Correct 313 ms 81668 KB Output is correct
112 Correct 404 ms 87664 KB Output is correct
113 Correct 506 ms 82508 KB Output is correct
114 Correct 399 ms 84020 KB Output is correct
115 Correct 359 ms 83856 KB Output is correct
116 Correct 16 ms 29956 KB Output is correct
117 Correct 183 ms 97352 KB Output is correct
118 Correct 236 ms 104708 KB Output is correct
119 Correct 21 ms 31060 KB Output is correct
120 Correct 22 ms 31092 KB Output is correct
121 Correct 22 ms 31076 KB Output is correct
122 Correct 22 ms 31120 KB Output is correct
123 Correct 20 ms 31104 KB Output is correct
124 Correct 339 ms 80432 KB Output is correct
125 Correct 20 ms 29948 KB Output is correct
126 Correct 16 ms 30056 KB Output is correct
127 Correct 16 ms 30036 KB Output is correct
128 Correct 387 ms 76336 KB Output is correct
129 Correct 373 ms 71848 KB Output is correct
130 Correct 439 ms 84156 KB Output is correct
131 Correct 387 ms 85196 KB Output is correct
132 Correct 409 ms 80908 KB Output is correct
133 Correct 407 ms 79536 KB Output is correct
134 Correct 370 ms 82372 KB Output is correct
135 Correct 452 ms 79500 KB Output is correct
136 Correct 332 ms 82684 KB Output is correct
137 Correct 423 ms 84576 KB Output is correct
138 Correct 405 ms 90648 KB Output is correct
139 Correct 419 ms 84008 KB Output is correct
140 Correct 330 ms 84040 KB Output is correct
141 Correct 159 ms 74860 KB Output is correct
142 Correct 211 ms 104768 KB Output is correct
143 Correct 18 ms 30832 KB Output is correct
144 Correct 26 ms 31048 KB Output is correct
145 Correct 28 ms 31084 KB Output is correct
146 Correct 21 ms 31028 KB Output is correct
147 Correct 22 ms 31072 KB Output is correct
148 Correct 16 ms 30076 KB Output is correct
149 Correct 16 ms 30164 KB Output is correct
150 Correct 16 ms 30164 KB Output is correct
151 Correct 17 ms 30128 KB Output is correct
152 Correct 19 ms 30184 KB Output is correct
153 Correct 200 ms 62296 KB Output is correct
154 Correct 351 ms 84920 KB Output is correct
155 Correct 383 ms 82276 KB Output is correct
156 Correct 430 ms 81328 KB Output is correct
157 Correct 385 ms 85188 KB Output is correct
158 Correct 391 ms 83932 KB Output is correct
159 Correct 366 ms 85220 KB Output is correct
160 Correct 343 ms 81560 KB Output is correct
161 Correct 417 ms 84688 KB Output is correct
162 Correct 293 ms 81596 KB Output is correct
163 Correct 375 ms 87764 KB Output is correct
164 Correct 408 ms 82484 KB Output is correct
165 Correct 414 ms 83996 KB Output is correct
166 Correct 331 ms 83912 KB Output is correct
167 Correct 17 ms 29980 KB Output is correct
168 Correct 187 ms 97308 KB Output is correct
169 Correct 195 ms 104804 KB Output is correct
170 Correct 20 ms 31060 KB Output is correct
171 Correct 23 ms 31156 KB Output is correct
172 Correct 26 ms 31032 KB Output is correct
173 Correct 21 ms 31092 KB Output is correct
174 Correct 20 ms 31116 KB Output is correct
175 Correct 279 ms 80380 KB Output is correct
176 Correct 17 ms 30036 KB Output is correct
177 Correct 445 ms 84200 KB Output is correct
178 Correct 330 ms 72332 KB Output is correct
179 Correct 380 ms 85108 KB Output is correct
180 Correct 328 ms 82520 KB Output is correct
181 Correct 340 ms 86368 KB Output is correct
182 Correct 346 ms 87136 KB Output is correct
183 Correct 383 ms 84636 KB Output is correct
184 Correct 310 ms 82512 KB Output is correct
185 Correct 335 ms 80504 KB Output is correct
186 Correct 312 ms 79488 KB Output is correct
187 Correct 306 ms 85644 KB Output is correct
188 Correct 469 ms 81576 KB Output is correct
189 Correct 422 ms 80816 KB Output is correct
190 Correct 380 ms 84796 KB Output is correct
191 Correct 388 ms 83940 KB Output is correct
192 Correct 328 ms 84808 KB Output is correct
193 Correct 340 ms 84892 KB Output is correct
194 Correct 365 ms 84784 KB Output is correct
195 Correct 182 ms 92720 KB Output is correct
196 Correct 188 ms 100804 KB Output is correct
197 Correct 207 ms 105476 KB Output is correct
198 Correct 203 ms 105616 KB Output is correct
199 Correct 17 ms 30676 KB Output is correct
200 Correct 20 ms 31052 KB Output is correct
201 Correct 18 ms 30968 KB Output is correct
202 Correct 20 ms 31060 KB Output is correct
203 Correct 21 ms 31192 KB Output is correct
204 Correct 20 ms 31188 KB Output is correct
205 Correct 18 ms 31060 KB Output is correct
206 Correct 23 ms 31060 KB Output is correct
207 Correct 22 ms 31152 KB Output is correct
208 Correct 21 ms 31072 KB Output is correct
209 Correct 18 ms 31316 KB Output is correct
210 Correct 20 ms 31532 KB Output is correct
211 Correct 17 ms 31348 KB Output is correct
212 Correct 20 ms 31136 KB Output is correct
213 Correct 21 ms 31188 KB Output is correct
214 Correct 21 ms 31188 KB Output is correct
215 Correct 16 ms 30036 KB Output is correct
216 Correct 15 ms 30036 KB Output is correct
217 Correct 16 ms 30048 KB Output is correct
218 Correct 19 ms 30344 KB Output is correct
219 Correct 16 ms 30164 KB Output is correct
220 Correct 17 ms 30164 KB Output is correct
221 Correct 17 ms 30180 KB Output is correct
222 Correct 16 ms 30088 KB Output is correct
223 Correct 16 ms 30184 KB Output is correct
224 Correct 15 ms 30164 KB Output is correct
225 Correct 15 ms 30184 KB Output is correct
226 Correct 16 ms 30152 KB Output is correct
227 Correct 15 ms 30164 KB Output is correct
228 Correct 15 ms 30184 KB Output is correct
229 Correct 408 ms 76252 KB Output is correct
230 Correct 296 ms 71820 KB Output is correct
231 Correct 416 ms 84268 KB Output is correct
232 Correct 366 ms 85196 KB Output is correct
233 Correct 303 ms 80928 KB Output is correct
234 Correct 312 ms 79632 KB Output is correct
235 Correct 323 ms 82324 KB Output is correct
236 Correct 404 ms 79488 KB Output is correct
237 Correct 300 ms 82720 KB Output is correct
238 Correct 405 ms 84576 KB Output is correct
239 Correct 409 ms 90752 KB Output is correct
240 Correct 381 ms 83920 KB Output is correct
241 Correct 322 ms 83860 KB Output is correct
242 Correct 133 ms 74764 KB Output is correct
243 Correct 219 ms 104748 KB Output is correct
244 Correct 20 ms 30932 KB Output is correct
245 Correct 21 ms 31060 KB Output is correct
246 Correct 21 ms 31092 KB Output is correct
247 Correct 19 ms 30956 KB Output is correct
248 Correct 21 ms 31084 KB Output is correct
249 Correct 16 ms 30036 KB Output is correct
250 Correct 16 ms 30188 KB Output is correct
251 Correct 15 ms 30164 KB Output is correct
252 Correct 16 ms 30164 KB Output is correct
253 Correct 15 ms 30164 KB Output is correct
254 Correct 192 ms 62352 KB Output is correct
255 Correct 306 ms 85024 KB Output is correct
256 Correct 312 ms 80340 KB Output is correct
257 Correct 310 ms 85052 KB Output is correct
258 Correct 322 ms 85768 KB Output is correct
259 Correct 314 ms 85820 KB Output is correct
260 Correct 375 ms 82288 KB Output is correct
261 Correct 368 ms 81336 KB Output is correct
262 Correct 385 ms 85100 KB Output is correct
263 Correct 395 ms 83932 KB Output is correct
264 Correct 349 ms 85268 KB Output is correct
265 Correct 342 ms 81512 KB Output is correct
266 Correct 392 ms 84592 KB Output is correct
267 Correct 297 ms 81696 KB Output is correct
268 Correct 391 ms 87764 KB Output is correct
269 Correct 431 ms 82500 KB Output is correct
270 Correct 390 ms 84000 KB Output is correct
271 Correct 308 ms 83920 KB Output is correct
272 Correct 15 ms 30052 KB Output is correct
273 Correct 184 ms 97304 KB Output is correct
274 Correct 221 ms 104812 KB Output is correct
275 Correct 19 ms 31072 KB Output is correct
276 Correct 18 ms 31096 KB Output is correct
277 Correct 18 ms 31060 KB Output is correct
278 Correct 19 ms 31104 KB Output is correct
279 Correct 19 ms 31148 KB Output is correct
280 Correct 277 ms 80476 KB Output is correct