oj.uz

답안 #781778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
781778 2023-07-13T10:48:17 Z Sam_a17 송신탑 (IOI22_towers) C++17
58 / 100
 4000 ms 9732 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 int N = 2e5 + 10;
int a[N], mid = -1;
int f1 = 1, n;
vector<int> b;
int pi[N];

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);
  }
};

segTreeMax seg_max, seg_all;

vector<long long> ai;

void init(int maxN, std::vector<int> H) {
  n = maxN;
  pair<int, int> mx = {0, 0};

  seg_all.init(n + 1);
  for(int i = 0; i < n; i++) {
    a[i] = H[i];
    seg_all.upd(i, a[i]);
    mx = max(mx, make_pair(a[i], i));
  }
  
  vector<int> lowRig(n + 1, n), lowLef(n + 1, -1);
  stack<pair<int, int>> st;
  for(int i = 0; i < n; i++) {
    while(!st.empty() && st.top().first > a[i]) {
      st.pop();
    }

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

  while(!st.empty()) st.pop();

  for(int i = n - 1; i >= 0; i--) {
    while(!st.empty() && st.top().first > a[i]) {
      st.pop();
    }

    if(!st.empty()) {
      lowRig[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]);
  }

  sort(all(ai));
  mid = mx.second;
  for(int i = 0; i < mid; i++) {
    if(a[i + 1] <= a[i]) {
      f1 = 0;
    }
  }

  for(int i = mid + 1; i < n; i++) {
    if(a[i] >= a[i - 1]) {
      f1 = 0;
    }
  }

  for(int i = 1; i < n - 1; i++) {
    pi[i] = pi[i - 1] + (a[i] > a[i - 1] && a[i] > a[i + 1]);
  }
  pi[n - 1] = pi[n - 2];
}

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;
  }

  if(f1) {
    if(R <= mid || L >= mid) {
      return 1;
    }

    if(R - L + 1 == 1) {
      return 1;
    }

    if(a[mid] - D >= max(a[L], a[R])) {
      return 2;
    } else {
      return 1;
    }
  } else if(D == 1) {
    int cur = pi[R - 1] - pi[L] + 1;
    return max(1, cur);
  } else {
    vector<long long> dp(n + 1);
    long long answ = 0;

    set<pair<long long, long long>> ft;
    deque<pair<int, int>> vec;
    seg_max.init(n + 5);
    for(int i = L; i <= R; i++) {
      dp[i] = 1;

      auto it = lower_bound(all(vec), make_pair(a[i] + D, -1));
      if(it != vec.end()) {
        int ind = it - vec.begin();
        if(vec[ind].second >= 1) {
          dp[i] = max(dp[i], seg_max.qry(0, vec[ind].second) + 1);
        }
      }

      while (!vec.empty() && a[i] > vec.front().first) {
        vec.pop_front();
      }
      vec.push_front({a[i], i});

      while(!ft.empty() && ft.begin()->first <= a[i] - D) {
        seg_max.upd(ft.begin()->second, dp[ft.begin()->second]);
        ft.erase(ft.begin());
      }
      ft.insert({a[i], i});

      answ = max(answ, dp[i]);
    }
 
    return answ;
  }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 3528 KB Output is correct
2 Correct 632 ms 6052 KB Output is correct
3 Correct 675 ms 6036 KB Output is correct
4 Correct 741 ms 6216 KB Output is correct
5 Correct 721 ms 6328 KB Output is correct
6 Correct 541 ms 6228 KB Output is correct
7 Correct 813 ms 6332 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 416 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 28 ms 4268 KB Output is correct
37 Correct 48 ms 8844 KB Output is correct
38 Correct 42 ms 7348 KB Output is correct
39 Correct 44 ms 8996 KB Output is correct
40 Correct 44 ms 7260 KB Output is correct
41 Correct 59 ms 9732 KB Output is correct
42 Correct 40 ms 7244 KB Output is correct
43 Correct 31 ms 6320 KB Output is correct
44 Correct 34 ms 6436 KB Output is correct
45 Correct 36 ms 7564 KB Output is correct
46 Correct 36 ms 7696 KB Output is correct
47 Correct 37 ms 5620 KB Output is correct
48 Correct 35 ms 5664 KB Output is correct
49 Correct 35 ms 5568 KB Output is correct
50 Correct 28 ms 6332 KB Output is correct
51 Correct 32 ms 6272 KB Output is correct
52 Correct 38 ms 5520 KB Output is correct
53 Correct 35 ms 5540 KB Output is correct
54 Correct 41 ms 5524 KB Output is correct
55 Correct 29 ms 6332 KB Output is correct
56 Correct 52 ms 5792 KB Output is correct
57 Correct 36 ms 5408 KB Output is correct
58 Correct 37 ms 5528 KB Output is correct
59 Correct 48 ms 5564 KB Output is correct
60 Correct 43 ms 5536 KB Output is correct
61 Correct 50 ms 5564 KB Output is correct
62 Correct 35 ms 5620 KB Output is correct
63 Correct 37 ms 5524 KB Output is correct
64 Correct 36 ms 6204 KB Output is correct
65 Correct 42 ms 6420 KB Output is correct
66 Correct 35 ms 5940 KB Output is correct
67 Correct 34 ms 6360 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 542 ms 5496 KB Output is correct
2 Correct 731 ms 5620 KB Output is correct
3 Correct 638 ms 5564 KB Output is correct
4 Correct 796 ms 5556 KB Output is correct
5 Correct 839 ms 5532 KB Output is correct
6 Correct 694 ms 5564 KB Output is correct
7 Correct 872 ms 5728 KB Output is correct
8 Correct 671 ms 6436 KB Output is correct
9 Correct 569 ms 6388 KB Output is correct
10 Correct 690 ms 5952 KB Output is correct
11 Correct 713 ms 6060 KB Output is correct
12 Correct 687 ms 6212 KB Output is correct
13 Correct 607 ms 6468 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 37 ms 5504 KB Output is correct
18 Correct 37 ms 5668 KB Output is correct
19 Correct 35 ms 5536 KB Output is correct
20 Correct 29 ms 6332 KB Output is correct
21 Correct 33 ms 6204 KB Output is correct
22 Correct 37 ms 5536 KB Output is correct
23 Correct 35 ms 5624 KB Output is correct
24 Correct 35 ms 5532 KB Output is correct
25 Correct 29 ms 6376 KB Output is correct
26 Correct 37 ms 5908 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 219 ms 1616 KB Output is correct
2 Correct 639 ms 5512 KB Output is correct
3 Correct 703 ms 5564 KB Output is correct
4 Correct 757 ms 5564 KB Output is correct
5 Correct 799 ms 5532 KB Output is correct
6 Correct 783 ms 5564 KB Output is correct
7 Correct 635 ms 5540 KB Output is correct
8 Correct 602 ms 6260 KB Output is correct
9 Correct 596 ms 6396 KB Output is correct
10 Correct 823 ms 6080 KB Output is correct
11 Correct 712 ms 6072 KB Output is correct
12 Correct 43 ms 5540 KB Output is correct
13 Correct 36 ms 5660 KB Output is correct
14 Correct 36 ms 5720 KB Output is correct
15 Correct 28 ms 6436 KB Output is correct
16 Correct 35 ms 5912 KB Output is correct
17 Correct 36 ms 5448 KB Output is correct
18 Correct 37 ms 5616 KB Output is correct
19 Correct 37 ms 5564 KB Output is correct
20 Correct 35 ms 5524 KB Output is correct
21 Correct 40 ms 5552 KB Output is correct
22 Correct 35 ms 5524 KB Output is correct
23 Correct 36 ms 5648 KB Output is correct
24 Correct 36 ms 6312 KB Output is correct
25 Correct 29 ms 6440 KB Output is correct
26 Correct 34 ms 5920 KB Output is correct
27 Correct 34 ms 6376 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 416 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 28 ms 4268 KB Output is correct
37 Correct 48 ms 8844 KB Output is correct
38 Correct 42 ms 7348 KB Output is correct
39 Correct 44 ms 8996 KB Output is correct
40 Correct 44 ms 7260 KB Output is correct
41 Correct 59 ms 9732 KB Output is correct
42 Correct 40 ms 7244 KB Output is correct
43 Correct 31 ms 6320 KB Output is correct
44 Correct 34 ms 6436 KB Output is correct
45 Correct 36 ms 7564 KB Output is correct
46 Correct 36 ms 7696 KB Output is correct
47 Correct 37 ms 5620 KB Output is correct
48 Correct 35 ms 5664 KB Output is correct
49 Correct 35 ms 5568 KB Output is correct
50 Correct 28 ms 6332 KB Output is correct
51 Correct 32 ms 6272 KB Output is correct
52 Correct 38 ms 5520 KB Output is correct
53 Correct 35 ms 5540 KB Output is correct
54 Correct 41 ms 5524 KB Output is correct
55 Correct 29 ms 6332 KB Output is correct
56 Correct 52 ms 5792 KB Output is correct
57 Correct 36 ms 5408 KB Output is correct
58 Correct 37 ms 5528 KB Output is correct
59 Correct 48 ms 5564 KB Output is correct
60 Correct 43 ms 5536 KB Output is correct
61 Correct 50 ms 5564 KB Output is correct
62 Correct 35 ms 5620 KB Output is correct
63 Correct 37 ms 5524 KB Output is correct
64 Correct 36 ms 6204 KB Output is correct
65 Correct 42 ms 6420 KB Output is correct
66 Correct 35 ms 5940 KB Output is correct
67 Correct 34 ms 6360 KB Output is correct
68 Correct 542 ms 5496 KB Output is correct
69 Correct 731 ms 5620 KB Output is correct
70 Correct 638 ms 5564 KB Output is correct
71 Correct 796 ms 5556 KB Output is correct
72 Correct 839 ms 5532 KB Output is correct
73 Correct 694 ms 5564 KB Output is correct
74 Correct 872 ms 5728 KB Output is correct
75 Correct 671 ms 6436 KB Output is correct
76 Correct 569 ms 6388 KB Output is correct
77 Correct 690 ms 5952 KB Output is correct
78 Correct 713 ms 6060 KB Output is correct
79 Correct 687 ms 6212 KB Output is correct
80 Correct 607 ms 6468 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 37 ms 5504 KB Output is correct
85 Correct 37 ms 5668 KB Output is correct
86 Correct 35 ms 5536 KB Output is correct
87 Correct 29 ms 6332 KB Output is correct
88 Correct 33 ms 6204 KB Output is correct
89 Correct 37 ms 5536 KB Output is correct
90 Correct 35 ms 5624 KB Output is correct
91 Correct 35 ms 5532 KB Output is correct
92 Correct 29 ms 6376 KB Output is correct
93 Correct 37 ms 5908 KB Output is correct
94 Correct 1 ms 336 KB Output is correct
95 Correct 1 ms 336 KB Output is correct
96 Correct 1 ms 336 KB Output is correct
97 Correct 1 ms 336 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 1 ms 336 KB Output is correct
100 Correct 1 ms 336 KB Output is correct
101 Correct 1 ms 336 KB Output is correct
102 Correct 1 ms 336 KB Output is correct
103 Correct 1 ms 336 KB Output is correct
104 Execution timed out 4009 ms 7600 KB Time limit exceeded
105 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 3528 KB Output is correct
2 Correct 632 ms 6052 KB Output is correct
3 Correct 675 ms 6036 KB Output is correct
4 Correct 741 ms 6216 KB Output is correct
5 Correct 721 ms 6328 KB Output is correct
6 Correct 541 ms 6228 KB Output is correct
7 Correct 813 ms 6332 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 0 ms 208 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 416 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 336 KB Output is correct
46 Correct 28 ms 4268 KB Output is correct
47 Correct 48 ms 8844 KB Output is correct
48 Correct 42 ms 7348 KB Output is correct
49 Correct 44 ms 8996 KB Output is correct
50 Correct 44 ms 7260 KB Output is correct
51 Correct 59 ms 9732 KB Output is correct
52 Correct 40 ms 7244 KB Output is correct
53 Correct 31 ms 6320 KB Output is correct
54 Correct 34 ms 6436 KB Output is correct
55 Correct 36 ms 7564 KB Output is correct
56 Correct 36 ms 7696 KB Output is correct
57 Correct 37 ms 5620 KB Output is correct
58 Correct 35 ms 5664 KB Output is correct
59 Correct 35 ms 5568 KB Output is correct
60 Correct 28 ms 6332 KB Output is correct
61 Correct 32 ms 6272 KB Output is correct
62 Correct 38 ms 5520 KB Output is correct
63 Correct 35 ms 5540 KB Output is correct
64 Correct 41 ms 5524 KB Output is correct
65 Correct 29 ms 6332 KB Output is correct
66 Correct 52 ms 5792 KB Output is correct
67 Correct 36 ms 5408 KB Output is correct
68 Correct 37 ms 5528 KB Output is correct
69 Correct 48 ms 5564 KB Output is correct
70 Correct 43 ms 5536 KB Output is correct
71 Correct 50 ms 5564 KB Output is correct
72 Correct 35 ms 5620 KB Output is correct
73 Correct 37 ms 5524 KB Output is correct
74 Correct 36 ms 6204 KB Output is correct
75 Correct 42 ms 6420 KB Output is correct
76 Correct 35 ms 5940 KB Output is correct
77 Correct 34 ms 6360 KB Output is correct
78 Correct 542 ms 5496 KB Output is correct
79 Correct 731 ms 5620 KB Output is correct
80 Correct 638 ms 5564 KB Output is correct
81 Correct 796 ms 5556 KB Output is correct
82 Correct 839 ms 5532 KB Output is correct
83 Correct 694 ms 5564 KB Output is correct
84 Correct 872 ms 5728 KB Output is correct
85 Correct 671 ms 6436 KB Output is correct
86 Correct 569 ms 6388 KB Output is correct
87 Correct 690 ms 5952 KB Output is correct
88 Correct 713 ms 6060 KB Output is correct
89 Correct 687 ms 6212 KB Output is correct
90 Correct 607 ms 6468 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 1 ms 336 KB Output is correct
93 Correct 1 ms 336 KB Output is correct
94 Correct 37 ms 5504 KB Output is correct
95 Correct 37 ms 5668 KB Output is correct
96 Correct 35 ms 5536 KB Output is correct
97 Correct 29 ms 6332 KB Output is correct
98 Correct 33 ms 6204 KB Output is correct
99 Correct 37 ms 5536 KB Output is correct
100 Correct 35 ms 5624 KB Output is correct
101 Correct 35 ms 5532 KB Output is correct
102 Correct 29 ms 6376 KB Output is correct
103 Correct 37 ms 5908 KB Output is correct
104 Correct 1 ms 336 KB Output is correct
105 Correct 1 ms 336 KB Output is correct
106 Correct 1 ms 336 KB Output is correct
107 Correct 1 ms 336 KB Output is correct
108 Correct 1 ms 336 KB Output is correct
109 Correct 1 ms 336 KB Output is correct
110 Correct 1 ms 336 KB Output is correct
111 Correct 1 ms 336 KB Output is correct
112 Correct 1 ms 336 KB Output is correct
113 Correct 1 ms 336 KB Output is correct
114 Correct 219 ms 1616 KB Output is correct
115 Correct 639 ms 5512 KB Output is correct
116 Correct 703 ms 5564 KB Output is correct
117 Correct 757 ms 5564 KB Output is correct
118 Correct 799 ms 5532 KB Output is correct
119 Correct 783 ms 5564 KB Output is correct
120 Correct 635 ms 5540 KB Output is correct
121 Correct 602 ms 6260 KB Output is correct
122 Correct 596 ms 6396 KB Output is correct
123 Correct 823 ms 6080 KB Output is correct
124 Correct 712 ms 6072 KB Output is correct
125 Correct 43 ms 5540 KB Output is correct
126 Correct 36 ms 5660 KB Output is correct
127 Correct 36 ms 5720 KB Output is correct
128 Correct 28 ms 6436 KB Output is correct
129 Correct 35 ms 5912 KB Output is correct
130 Correct 36 ms 5448 KB Output is correct
131 Correct 37 ms 5616 KB Output is correct
132 Correct 37 ms 5564 KB Output is correct
133 Correct 35 ms 5524 KB Output is correct
134 Correct 40 ms 5552 KB Output is correct
135 Correct 35 ms 5524 KB Output is correct
136 Correct 36 ms 5648 KB Output is correct
137 Correct 36 ms 6312 KB Output is correct
138 Correct 29 ms 6440 KB Output is correct
139 Correct 34 ms 5920 KB Output is correct
140 Correct 34 ms 6376 KB Output is correct
141 Correct 1 ms 336 KB Output is correct
142 Correct 1 ms 336 KB Output is correct
143 Correct 1 ms 336 KB Output is correct
144 Correct 1 ms 336 KB Output is correct
145 Correct 1 ms 336 KB Output is correct
146 Correct 1 ms 336 KB Output is correct
147 Correct 1 ms 304 KB Output is correct
148 Correct 1 ms 336 KB Output is correct
149 Correct 1 ms 336 KB Output is correct
150 Correct 1 ms 336 KB Output is correct
151 Correct 1 ms 336 KB Output is correct
152 Correct 1 ms 336 KB Output is correct
153 Correct 1 ms 336 KB Output is correct
154 Correct 1 ms 336 KB Output is correct
155 Correct 1 ms 336 KB Output is correct
156 Correct 1 ms 336 KB Output is correct
157 Execution timed out 4009 ms 7600 KB Time limit exceeded
158 Halted 0 ms 0 KB -