oj.uz

답안 #781934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781934 2023-07-13T13:52:24 Z Sam_a17 송신탑 (IOI22_towers) C++17
100 / 100
 1340 ms 41788 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 blt __builtin_popcount
 
#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(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
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, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } 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(vector <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> void print(Tree <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 << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// 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 == "input") {
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
//   } else if(str != "") {
//     freopen((str + ".in").c_str(), "r", stdin);
//     freopen((str + ".out").c_str(), "w", stdout);
//   }
// }

const long long ind = 2e9;
const int N = 2e5 + 10;
int a[N], mid = -1;
int f1 = 1, n;
vector<int> b;
int pi[N];

vector<pair<long long, int>> ai;


struct segTreeMax {
  vector<long long> mTree;
  int size;
 
  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, 0);
  }
 
  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      mTree[x] = v;
      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] = max(mTree[2 * x + 1], mTree[2 * x + 2]);
  }
 
  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }
 
  long long qry (int l, int r, int x, int lx, int rx) { // range queries
    if(l >= rx || lx >= r) {
      return 0;
    }
    if(lx >= l && r >= rx) {
      return mTree[x];
    }
 
    int m = (rx + lx) / 2;
    long long s1 = qry(l, r, 2 * x + 1, lx, m);
    long long s2 = qry(l, r, 2 * x + 2, m, rx);
    return max(s1, s2);
  }
 
  long long qry(int l, int r) {
    if(l >= r) {
      return -1;
    } 
    return qry(l, r, 0, 0, size);
  }

  int find(long long k, int l, int x, int lx, int rx) {
    if (mTree[x] < k) {
      return -1;
    }

    if (rx <= l) {
      return -1;
    }
 
    if(rx - lx == 1) {
      return lx;
    }
 
    int mid = (lx + rx) / 2;
    int answ = find(k, l, 2 * x + 1, lx, mid);
 
    if (answ == -1) {
      answ = find(k, l, 2 * x + 2, mid, rx);
    }
    return answ;
  }
 
  int find(long long k, int l) {
    return find(k, l, 0, 0, size);
  }

  int find2(long long k, int r, int x, int lx, int rx) {
    if (mTree[x] < k) {
      return -1;
    }

    if (lx > r) {
      return -1;
    }
 
    if(rx - lx == 1) {
      return lx;
    }
 
    int mid = (lx + rx) / 2;
    int answ = find2(k, r, 2 * x + 2, mid, rx);

    if (answ == -1) {
      answ = find2(k, r, 2 * x + 1, lx, mid);
    }
    return answ;
  }
 
  int find2(long long k, int r) {
    return find2(k, r, 0, 0, size);
  }

};

struct segTree {
  struct node {
    long long max_d, min_d;
    long long max_dist, max_dist2;
  };
  vector<node> mTree;
  int size;

  node merge(node a, node b) {
    if(b.max_d == -1) {
      return a;
    }
    
    if(a.max_d == -1) {
      return b;
    }
    
    a.max_dist2 = max({a.max_dist2, b.max_dist2, b.max_d - a.min_d});
    a.max_dist = max({a.max_dist, b.max_dist, a.max_d - b.min_d});

    a.max_d = max(a.max_d, b.max_d);
    a.min_d = min(a.min_d, b.min_d);
    return a;
  }
 
  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, {-1, -1, 0, 0});
  }
 
  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      mTree[x].max_d = mTree[x].min_d = v;
      mTree[x].max_dist = mTree[x].max_dist2 = 0;
      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] = merge(mTree[2 * x + 1], mTree[2 * x + 2]);
  }
 
  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }
 
  node qry (int l, int r, int x, int lx, int rx) { // range queries
    if(l >= rx || lx >= r) {
      return {-1, -1, 0, 0};
    }
    if(lx >= l && r >= rx) {
      return mTree[x];
    }
 
    int m = (rx + lx) / 2;
    node s1 = qry(l, r, 2 * x + 1, lx, m);
    node s2 = qry(l, r, 2 * x + 2, m, rx);
    return merge(s1, s2);
  }
 
  node qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

struct mergeSortTree {
  vector<vector<int>> mTree;
  int size;

  void merge(int x, vector<int>& li, vector<int>& ri) {
    int l = 0, r = 0;
    while (l < sz(li) || r < sz(ri)) {
      if(l < sz(li) && r < sz(ri)) {
        if(li[l] < ri[r]) {
          mTree[x].push_back(li[l++]);
        } else {
          mTree[x].push_back(ri[r++]);
        }
      } else if(l < sz(li)) {
        mTree[x].push_back(li[l++]);
      } else {
        mTree[x].push_back(ri[r++]);
      }
    }
  }

  void build(int x, int lx, int rx) {
    if(rx - lx == 1) {
      if(lx < n) {
        mTree[x].push_back(ai[lx].second);
      }
    } else {
      int mid = (lx + rx) / 2;
      build(2 * x + 1, lx, mid);
      build(2 * x + 2, mid, rx);
      merge(x, mTree[2 * x + 1], mTree[2 * x + 2]);
    }
  }

  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, {});
    build(0, 0, size);
  }
 
  int qry (int l, int r, int lix, int rix, int x, int lx, int rx) {
    if(l >= rx || lx >= r) {
      return 0;
    }

    if(lx >= l && r >= rx) {
      auto itl = lower_bound(all(mTree[x]), lix);
      if(itl == mTree[x].end()) return 0;
      int indl = itl - mTree[x].begin();

      auto indr = upper_bound(all(mTree[x]), rix) - mTree[x].begin() - 1;
      
      if(indl <= indr) {
        return indr - indl + 1;
      } else {
        return 0;
      }
    }
 
    int m = (rx + lx) / 2;
    int s1 = qry(l, r, lix, rix, 2 * x + 1, lx, m);
    int s2 = qry(l, r, lix, rix, 2 * x + 2, m, rx);
    return s1 + s2;
  }
 
  int qry(int l, int r, int lix, int rix) {
    return qry(l, r, lix, rix, 0, 0, size);
  }

  pair<int, int> qry2(int l, int r, int lix, int rix, int x, int lx, int rx) {
    if(l >= rx || lx >= r) {
      return {n, -1};
    }

    if(lx >= l && r >= rx) {
      auto itl = lower_bound(all(mTree[x]), lix);
      if(itl == mTree[x].end()) return {n, -1};
      int indl = itl - mTree[x].begin();

      auto indr = upper_bound(all(mTree[x]), rix) - mTree[x].begin() - 1;
      if(indl <= indr) {
        return {mTree[x][indl], mTree[x][indr]};
      } else {
        return {n, -1};
      }
    }
 
    int m = (rx + lx) / 2;
    pair<int, int> s1 = qry2(l, r, lix, rix, 2 * x + 1, lx, m);
    pair<int, int> s2 = qry2(l, r, lix, rix, 2 * x + 2, m, rx);
    return {min(s1.first, s2.first), max(s1.second, s2.second)};
  }
 
  pair<int, int> qry2(int l, int r, int lix, int rix) {
    return qry2(l, r, lix, rix, 0, 0, size);
  }
};

struct segTreeMin {
  vector<long long> mTree;
  int size;
 
  void init(long long n) {
    size = 1;
    while(size < n)  {
      size *= 2;
    }
    mTree.assign(2 * size - 1, INT64_MAX);
  }
 
  void upd(int u, long long v, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      mTree[x] = v;
      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] = min(mTree[2 * x + 1], mTree[2 * x + 2]);
  }
 
  void upd(int u, long long v) {
    upd(u, v, 0, 0, size);
  }
 
  long long qry (int l, int r, int x, int lx, int rx) { // range queries
    if(l >= rx || lx >= r) {
      return INT64_MAX;
    }
    if(lx >= l && r >= rx) {
      return mTree[x];
    }
 
    int m = (rx + lx) / 2;
    long long s1 = qry(l, r, 2 * x + 1, lx, m);
    long long s2 = qry(l, r, 2 * x + 2, m, rx);
    return min(s1, s2);
  }
 
  long long qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

segTreeMin seg_min;
segTree segt;
segTreeMax seg_all;
mergeSortTree mt;

map<long long, int> mp;
void init(int maxN, std::vector<int> H) {
  n = maxN;

  seg_all.init(n + 1);
  seg_min.init(n + 1);
  for(int i = 0; i < n; i++) {
    a[i] = H[i];
    seg_min.upd(i, a[i]);
    seg_all.upd(i, a[i]);

    mp[a[i]] = i;
  }
  
  vector<int> lowRig(n + 1, n), lowLef(n + 1, -1);
  stack<pair<int, int>> st;
  segt.init(n + 1);

  for(int i = 0; i < n; i++) {
    segt.upd(i, a[i]);
    while(!st.empty() && st.top().first > a[i]) {
      lowRig[st.top().second] = i;
      st.pop();
    }

    if(!st.empty()) {
      lowLef[i] = st.top().second;
    }
    st.push({a[i], i});
  }

  for(int i = 0; i < n; i++) {
    long long curl = seg_all.qry(lowLef[i] + 1, i);
    if(lowLef[i] == -1) curl = 1e10 + 10;
    long long curr = seg_all.qry(i + 1, lowRig[i]);
    if(lowRig[i] == n) curr = 1e10 + 10;
    ai.push_back({min(curl, curr) - a[i], i});
  }

  sort(all(ai));

  mt.init(n + 1);
}

int max_towers(int L, int R, int D) {

  //
  // if(L == 0 && R == n - 1) {
  //   auto it = lower_bound(all(ai), (long long )D);
  //   int answ = 1;
  //   if(it != ai.end()) {
  //     int ind = it - ai.begin();
  //     answ = max(answ, n - ind);
  //   }
  //   return answ;
  // }

  //
  auto it = lower_bound(all(ai), make_pair((long long) D, 0));
  if(it == ai.end()) {
    return 1;
  }

  int ind = it - ai.begin();
  int ans = mt.qry(ind, n, L, R);
 
  pair<int, int> pr = mt.qry2(ind, n, L, R);

  if(ans == 0) {
    long long cur = seg_min.qry(L, R + 1);
    pr = {mp[cur], mp[cur]};
    ans = 1;
  }

  if(pr.first <= pr.second) {
    int indi = seg_all.find(a[pr.second] + D, pr.second + 1);

    if(indi != -1 && indi <= R) {
      int delta = segt.qry(indi, R + 1).max_dist;
      if(delta >= D) {
        ans++;
      }
    }

    indi = seg_all.find2(a[pr.first] + D, pr.first - 1);
  
    if(indi != -1 && indi >= L) {
      int delta = segt.qry(L, indi + 1).max_dist2;
      if(delta >= D) {
        ans++;
      }
    }
  }
  
  return max(ans, 1);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 499 ms 22384 KB Output is correct
2 Correct 987 ms 40772 KB Output is correct
3 Correct 1036 ms 40856 KB Output is correct
4 Correct 875 ms 41664 KB Output is correct
5 Correct 950 ms 40780 KB Output is correct
6 Correct 1209 ms 40868 KB Output is correct
7 Correct 1052 ms 40756 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 2 ms 976 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 2 ms 976 KB Output is correct
4 Correct 2 ms 976 KB Output is correct
5 Correct 2 ms 976 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 976 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 976 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 976 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 2 ms 976 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 3 ms 976 KB Output is correct
20 Correct 2 ms 976 KB Output is correct
21 Correct 2 ms 976 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 2 ms 976 KB Output is correct
24 Correct 2 ms 976 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 976 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 2 ms 976 KB Output is correct
29 Correct 2 ms 976 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 3 ms 976 KB Output is correct
32 Correct 2 ms 976 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 3 ms 976 KB Output is correct
35 Correct 3 ms 976 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 2 ms 976 KB Output is correct
4 Correct 2 ms 976 KB Output is correct
5 Correct 2 ms 976 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 976 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 976 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 976 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 2 ms 976 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 3 ms 976 KB Output is correct
20 Correct 2 ms 976 KB Output is correct
21 Correct 2 ms 976 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 2 ms 976 KB Output is correct
24 Correct 2 ms 976 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 976 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 2 ms 976 KB Output is correct
29 Correct 2 ms 976 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 3 ms 976 KB Output is correct
32 Correct 2 ms 976 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 3 ms 976 KB Output is correct
35 Correct 3 ms 976 KB Output is correct
36 Correct 79 ms 23572 KB Output is correct
37 Correct 132 ms 40728 KB Output is correct
38 Correct 127 ms 40784 KB Output is correct
39 Correct 125 ms 40728 KB Output is correct
40 Correct 129 ms 40824 KB Output is correct
41 Correct 136 ms 40968 KB Output is correct
42 Correct 125 ms 40808 KB Output is correct
43 Correct 98 ms 41564 KB Output is correct
44 Correct 94 ms 40836 KB Output is correct
45 Correct 103 ms 41256 KB Output is correct
46 Correct 103 ms 40780 KB Output is correct
47 Correct 128 ms 40800 KB Output is correct
48 Correct 149 ms 40812 KB Output is correct
49 Correct 137 ms 40728 KB Output is correct
50 Correct 102 ms 40824 KB Output is correct
51 Correct 100 ms 41564 KB Output is correct
52 Correct 127 ms 40720 KB Output is correct
53 Correct 126 ms 40792 KB Output is correct
54 Correct 128 ms 40760 KB Output is correct
55 Correct 95 ms 40820 KB Output is correct
56 Correct 103 ms 41136 KB Output is correct
57 Correct 122 ms 40032 KB Output is correct
58 Correct 134 ms 40732 KB Output is correct
59 Correct 131 ms 40880 KB Output is correct
60 Correct 130 ms 40748 KB Output is correct
61 Correct 136 ms 40712 KB Output is correct
62 Correct 125 ms 40744 KB Output is correct
63 Correct 128 ms 40720 KB Output is correct
64 Correct 98 ms 41652 KB Output is correct
65 Correct 94 ms 40732 KB Output is correct
66 Correct 101 ms 41036 KB Output is correct
67 Correct 99 ms 40804 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1085 ms 40604 KB Output is correct
2 Correct 1124 ms 40784 KB Output is correct
3 Correct 1131 ms 40756 KB Output is correct
4 Correct 1315 ms 40728 KB Output is correct
5 Correct 1028 ms 41016 KB Output is correct
6 Correct 1182 ms 40928 KB Output is correct
7 Correct 1218 ms 40760 KB Output is correct
8 Correct 1166 ms 41788 KB Output is correct
9 Correct 1150 ms 40752 KB Output is correct
10 Correct 1067 ms 41380 KB Output is correct
11 Correct 1048 ms 40732 KB Output is correct
12 Correct 1138 ms 40792 KB Output is correct
13 Correct 1082 ms 40748 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 2 ms 976 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 132 ms 40728 KB Output is correct
18 Correct 128 ms 40768 KB Output is correct
19 Correct 125 ms 40732 KB Output is correct
20 Correct 94 ms 40732 KB Output is correct
21 Correct 99 ms 41636 KB Output is correct
22 Correct 135 ms 40752 KB Output is correct
23 Correct 126 ms 40760 KB Output is correct
24 Correct 126 ms 40752 KB Output is correct
25 Correct 93 ms 40760 KB Output is correct
26 Correct 105 ms 41136 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 2 ms 976 KB Output is correct
29 Correct 3 ms 976 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 2 ms 976 KB Output is correct
32 Correct 2 ms 916 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 2 ms 976 KB Output is correct
35 Correct 2 ms 976 KB Output is correct
36 Correct 2 ms 976 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 318 ms 10032 KB Output is correct
2 Correct 1080 ms 40748 KB Output is correct
3 Correct 1109 ms 40788 KB Output is correct
4 Correct 1055 ms 40800 KB Output is correct
5 Correct 1099 ms 40752 KB Output is correct
6 Correct 979 ms 40788 KB Output is correct
7 Correct 1057 ms 40752 KB Output is correct
8 Correct 764 ms 41664 KB Output is correct
9 Correct 946 ms 40872 KB Output is correct
10 Correct 921 ms 41108 KB Output is correct
11 Correct 915 ms 40740 KB Output is correct
12 Correct 127 ms 40752 KB Output is correct
13 Correct 124 ms 40736 KB Output is correct
14 Correct 126 ms 40748 KB Output is correct
15 Correct 100 ms 40888 KB Output is correct
16 Correct 104 ms 41148 KB Output is correct
17 Correct 125 ms 40016 KB Output is correct
18 Correct 128 ms 40760 KB Output is correct
19 Correct 138 ms 40852 KB Output is correct
20 Correct 134 ms 40816 KB Output is correct
21 Correct 130 ms 40804 KB Output is correct
22 Correct 128 ms 40800 KB Output is correct
23 Correct 128 ms 40852 KB Output is correct
24 Correct 107 ms 41588 KB Output is correct
25 Correct 95 ms 40724 KB Output is correct
26 Correct 102 ms 41008 KB Output is correct
27 Correct 102 ms 40716 KB Output is correct
28 Correct 2 ms 976 KB Output is correct
29 Correct 2 ms 976 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 2 ms 976 KB Output is correct
32 Correct 2 ms 976 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 2 ms 976 KB Output is correct
35 Correct 2 ms 976 KB Output is correct
36 Correct 2 ms 976 KB Output is correct
37 Correct 2 ms 976 KB Output is correct
38 Correct 2 ms 976 KB Output is correct
39 Correct 2 ms 976 KB Output is correct
40 Correct 4 ms 976 KB Output is correct
41 Correct 2 ms 976 KB Output is correct
42 Correct 2 ms 976 KB Output is correct
43 Correct 2 ms 976 KB Output is correct

Subtask #6
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 464 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 2 ms 976 KB Output is correct
4 Correct 2 ms 976 KB Output is correct
5 Correct 2 ms 976 KB Output is correct
6 Correct 2 ms 976 KB Output is correct
7 Correct 2 ms 976 KB Output is correct
8 Correct 2 ms 976 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 2 ms 976 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 2 ms 976 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 976 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 2 ms 976 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 3 ms 976 KB Output is correct
20 Correct 2 ms 976 KB Output is correct
21 Correct 2 ms 976 KB Output is correct
22 Correct 2 ms 976 KB Output is correct
23 Correct 2 ms 976 KB Output is correct
24 Correct 2 ms 976 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 2 ms 976 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 2 ms 976 KB Output is correct
29 Correct 2 ms 976 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 3 ms 976 KB Output is correct
32 Correct 2 ms 976 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 3 ms 976 KB Output is correct
35 Correct 3 ms 976 KB Output is correct
36 Correct 79 ms 23572 KB Output is correct
37 Correct 132 ms 40728 KB Output is correct
38 Correct 127 ms 40784 KB Output is correct
39 Correct 125 ms 40728 KB Output is correct
40 Correct 129 ms 40824 KB Output is correct
41 Correct 136 ms 40968 KB Output is correct
42 Correct 125 ms 40808 KB Output is correct
43 Correct 98 ms 41564 KB Output is correct
44 Correct 94 ms 40836 KB Output is correct
45 Correct 103 ms 41256 KB Output is correct
46 Correct 103 ms 40780 KB Output is correct
47 Correct 128 ms 40800 KB Output is correct
48 Correct 149 ms 40812 KB Output is correct
49 Correct 137 ms 40728 KB Output is correct
50 Correct 102 ms 40824 KB Output is correct
51 Correct 100 ms 41564 KB Output is correct
52 Correct 127 ms 40720 KB Output is correct
53 Correct 126 ms 40792 KB Output is correct
54 Correct 128 ms 40760 KB Output is correct
55 Correct 95 ms 40820 KB Output is correct
56 Correct 103 ms 41136 KB Output is correct
57 Correct 122 ms 40032 KB Output is correct
58 Correct 134 ms 40732 KB Output is correct
59 Correct 131 ms 40880 KB Output is correct
60 Correct 130 ms 40748 KB Output is correct
61 Correct 136 ms 40712 KB Output is correct
62 Correct 125 ms 40744 KB Output is correct
63 Correct 128 ms 40720 KB Output is correct
64 Correct 98 ms 41652 KB Output is correct
65 Correct 94 ms 40732 KB Output is correct
66 Correct 101 ms 41036 KB Output is correct
67 Correct 99 ms 40804 KB Output is correct
68 Correct 1085 ms 40604 KB Output is correct
69 Correct 1124 ms 40784 KB Output is correct
70 Correct 1131 ms 40756 KB Output is correct
71 Correct 1315 ms 40728 KB Output is correct
72 Correct 1028 ms 41016 KB Output is correct
73 Correct 1182 ms 40928 KB Output is correct
74 Correct 1218 ms 40760 KB Output is correct
75 Correct 1166 ms 41788 KB Output is correct
76 Correct 1150 ms 40752 KB Output is correct
77 Correct 1067 ms 41380 KB Output is correct
78 Correct 1048 ms 40732 KB Output is correct
79 Correct 1138 ms 40792 KB Output is correct
80 Correct 1082 ms 40748 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 2 ms 976 KB Output is correct
83 Correct 2 ms 976 KB Output is correct
84 Correct 132 ms 40728 KB Output is correct
85 Correct 128 ms 40768 KB Output is correct
86 Correct 125 ms 40732 KB Output is correct
87 Correct 94 ms 40732 KB Output is correct
88 Correct 99 ms 41636 KB Output is correct
89 Correct 135 ms 40752 KB Output is correct
90 Correct 126 ms 40760 KB Output is correct
91 Correct 126 ms 40752 KB Output is correct
92 Correct 93 ms 40760 KB Output is correct
93 Correct 105 ms 41136 KB Output is correct
94 Correct 2 ms 976 KB Output is correct
95 Correct 2 ms 976 KB Output is correct
96 Correct 3 ms 976 KB Output is correct
97 Correct 2 ms 976 KB Output is correct
98 Correct 2 ms 976 KB Output is correct
99 Correct 2 ms 916 KB Output is correct
100 Correct 2 ms 976 KB Output is correct
101 Correct 2 ms 976 KB Output is correct
102 Correct 2 ms 976 KB Output is correct
103 Correct 2 ms 976 KB Output is correct
104 Correct 1098 ms 38324 KB Output is correct
105 Correct 1179 ms 40724 KB Output is correct
106 Correct 1272 ms 40800 KB Output is correct
107 Correct 1228 ms 40824 KB Output is correct
108 Correct 1071 ms 40716 KB Output is correct
109 Correct 1170 ms 40824 KB Output is correct
110 Correct 1314 ms 40740 KB Output is correct
111 Correct 1044 ms 41660 KB Output is correct
112 Correct 982 ms 40728 KB Output is correct
113 Correct 975 ms 41008 KB Output is correct
114 Correct 983 ms 40756 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 499 ms 22384 KB Output is correct
2 Correct 987 ms 40772 KB Output is correct
3 Correct 1036 ms 40856 KB Output is correct
4 Correct 875 ms 41664 KB Output is correct
5 Correct 950 ms 40780 KB Output is correct
6 Correct 1209 ms 40868 KB Output is correct
7 Correct 1052 ms 40756 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 2 ms 976 KB Output is correct
10 Correct 2 ms 976 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 4 ms 976 KB Output is correct
13 Correct 2 ms 976 KB Output is correct
14 Correct 2 ms 976 KB Output is correct
15 Correct 2 ms 976 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 2 ms 976 KB Output is correct
18 Correct 2 ms 976 KB Output is correct
19 Correct 2 ms 976 KB Output is correct
20 Correct 2 ms 976 KB Output is correct
21 Correct 2 ms 976 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 2 ms 976 KB Output is correct
24 Correct 2 ms 976 KB Output is correct
25 Correct 2 ms 976 KB Output is correct
26 Correct 2 ms 976 KB Output is correct
27 Correct 2 ms 976 KB Output is correct
28 Correct 2 ms 976 KB Output is correct
29 Correct 3 ms 976 KB Output is correct
30 Correct 2 ms 976 KB Output is correct
31 Correct 2 ms 976 KB Output is correct
32 Correct 2 ms 976 KB Output is correct
33 Correct 2 ms 976 KB Output is correct
34 Correct 2 ms 976 KB Output is correct
35 Correct 1 ms 592 KB Output is correct
36 Correct 2 ms 976 KB Output is correct
37 Correct 2 ms 976 KB Output is correct
38 Correct 2 ms 976 KB Output is correct
39 Correct 2 ms 976 KB Output is correct
40 Correct 2 ms 976 KB Output is correct
41 Correct 3 ms 976 KB Output is correct
42 Correct 2 ms 976 KB Output is correct
43 Correct 2 ms 976 KB Output is correct
44 Correct 3 ms 976 KB Output is correct
45 Correct 3 ms 976 KB Output is correct
46 Correct 79 ms 23572 KB Output is correct
47 Correct 132 ms 40728 KB Output is correct
48 Correct 127 ms 40784 KB Output is correct
49 Correct 125 ms 40728 KB Output is correct
50 Correct 129 ms 40824 KB Output is correct
51 Correct 136 ms 40968 KB Output is correct
52 Correct 125 ms 40808 KB Output is correct
53 Correct 98 ms 41564 KB Output is correct
54 Correct 94 ms 40836 KB Output is correct
55 Correct 103 ms 41256 KB Output is correct
56 Correct 103 ms 40780 KB Output is correct
57 Correct 128 ms 40800 KB Output is correct
58 Correct 149 ms 40812 KB Output is correct
59 Correct 137 ms 40728 KB Output is correct
60 Correct 102 ms 40824 KB Output is correct
61 Correct 100 ms 41564 KB Output is correct
62 Correct 127 ms 40720 KB Output is correct
63 Correct 126 ms 40792 KB Output is correct
64 Correct 128 ms 40760 KB Output is correct
65 Correct 95 ms 40820 KB Output is correct
66 Correct 103 ms 41136 KB Output is correct
67 Correct 122 ms 40032 KB Output is correct
68 Correct 134 ms 40732 KB Output is correct
69 Correct 131 ms 40880 KB Output is correct
70 Correct 130 ms 40748 KB Output is correct
71 Correct 136 ms 40712 KB Output is correct
72 Correct 125 ms 40744 KB Output is correct
73 Correct 128 ms 40720 KB Output is correct
74 Correct 98 ms 41652 KB Output is correct
75 Correct 94 ms 40732 KB Output is correct
76 Correct 101 ms 41036 KB Output is correct
77 Correct 99 ms 40804 KB Output is correct
78 Correct 1085 ms 40604 KB Output is correct
79 Correct 1124 ms 40784 KB Output is correct
80 Correct 1131 ms 40756 KB Output is correct
81 Correct 1315 ms 40728 KB Output is correct
82 Correct 1028 ms 41016 KB Output is correct
83 Correct 1182 ms 40928 KB Output is correct
84 Correct 1218 ms 40760 KB Output is correct
85 Correct 1166 ms 41788 KB Output is correct
86 Correct 1150 ms 40752 KB Output is correct
87 Correct 1067 ms 41380 KB Output is correct
88 Correct 1048 ms 40732 KB Output is correct
89 Correct 1138 ms 40792 KB Output is correct
90 Correct 1082 ms 40748 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 2 ms 976 KB Output is correct
93 Correct 2 ms 976 KB Output is correct
94 Correct 132 ms 40728 KB Output is correct
95 Correct 128 ms 40768 KB Output is correct
96 Correct 125 ms 40732 KB Output is correct
97 Correct 94 ms 40732 KB Output is correct
98 Correct 99 ms 41636 KB Output is correct
99 Correct 135 ms 40752 KB Output is correct
100 Correct 126 ms 40760 KB Output is correct
101 Correct 126 ms 40752 KB Output is correct
102 Correct 93 ms 40760 KB Output is correct
103 Correct 105 ms 41136 KB Output is correct
104 Correct 2 ms 976 KB Output is correct
105 Correct 2 ms 976 KB Output is correct
106 Correct 3 ms 976 KB Output is correct
107 Correct 2 ms 976 KB Output is correct
108 Correct 2 ms 976 KB Output is correct
109 Correct 2 ms 916 KB Output is correct
110 Correct 2 ms 976 KB Output is correct
111 Correct 2 ms 976 KB Output is correct
112 Correct 2 ms 976 KB Output is correct
113 Correct 2 ms 976 KB Output is correct
114 Correct 318 ms 10032 KB Output is correct
115 Correct 1080 ms 40748 KB Output is correct
116 Correct 1109 ms 40788 KB Output is correct
117 Correct 1055 ms 40800 KB Output is correct
118 Correct 1099 ms 40752 KB Output is correct
119 Correct 979 ms 40788 KB Output is correct
120 Correct 1057 ms 40752 KB Output is correct
121 Correct 764 ms 41664 KB Output is correct
122 Correct 946 ms 40872 KB Output is correct
123 Correct 921 ms 41108 KB Output is correct
124 Correct 915 ms 40740 KB Output is correct
125 Correct 127 ms 40752 KB Output is correct
126 Correct 124 ms 40736 KB Output is correct
127 Correct 126 ms 40748 KB Output is correct
128 Correct 100 ms 40888 KB Output is correct
129 Correct 104 ms 41148 KB Output is correct
130 Correct 125 ms 40016 KB Output is correct
131 Correct 128 ms 40760 KB Output is correct
132 Correct 138 ms 40852 KB Output is correct
133 Correct 134 ms 40816 KB Output is correct
134 Correct 130 ms 40804 KB Output is correct
135 Correct 128 ms 40800 KB Output is correct
136 Correct 128 ms 40852 KB Output is correct
137 Correct 107 ms 41588 KB Output is correct
138 Correct 95 ms 40724 KB Output is correct
139 Correct 102 ms 41008 KB Output is correct
140 Correct 102 ms 40716 KB Output is correct
141 Correct 2 ms 976 KB Output is correct
142 Correct 2 ms 976 KB Output is correct
143 Correct 2 ms 976 KB Output is correct
144 Correct 2 ms 976 KB Output is correct
145 Correct 2 ms 976 KB Output is correct
146 Correct 1 ms 592 KB Output is correct
147 Correct 2 ms 976 KB Output is correct
148 Correct 2 ms 976 KB Output is correct
149 Correct 2 ms 976 KB Output is correct
150 Correct 2 ms 976 KB Output is correct
151 Correct 2 ms 976 KB Output is correct
152 Correct 2 ms 976 KB Output is correct
153 Correct 4 ms 976 KB Output is correct
154 Correct 2 ms 976 KB Output is correct
155 Correct 2 ms 976 KB Output is correct
156 Correct 2 ms 976 KB Output is correct
157 Correct 1098 ms 38324 KB Output is correct
158 Correct 1179 ms 40724 KB Output is correct
159 Correct 1272 ms 40800 KB Output is correct
160 Correct 1228 ms 40824 KB Output is correct
161 Correct 1071 ms 40716 KB Output is correct
162 Correct 1170 ms 40824 KB Output is correct
163 Correct 1314 ms 40740 KB Output is correct
164 Correct 1044 ms 41660 KB Output is correct
165 Correct 982 ms 40728 KB Output is correct
166 Correct 975 ms 41008 KB Output is correct
167 Correct 983 ms 40756 KB Output is correct
168 Correct 1 ms 304 KB Output is correct
169 Correct 774 ms 17084 KB Output is correct
170 Correct 1262 ms 40780 KB Output is correct
171 Correct 1247 ms 40724 KB Output is correct
172 Correct 1183 ms 40764 KB Output is correct
173 Correct 1340 ms 40804 KB Output is correct
174 Correct 1307 ms 40772 KB Output is correct
175 Correct 1245 ms 40728 KB Output is correct
176 Correct 949 ms 41660 KB Output is correct
177 Correct 923 ms 40800 KB Output is correct
178 Correct 1105 ms 40868 KB Output is correct
179 Correct 1040 ms 40820 KB Output is correct