oj.uz

답안 #897885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897885 2024-01-03T22:56:44 Z cadmiumsky Two Dishes (JOI19_dishes) C++17
100 / 100
 3857 ms 225872 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<ll,ll>;
using tii = tuple<int,int,int>;

// default constructorul trebuie sa fie identitate
// sorry it had to be this way
template<typename Mono, typename Lazy>
struct AINT {
  const Mono ID_M = Mono();
  const Lazy ID_L = Lazy();
  struct Node {
    Mono val;
    Lazy lazy;
    Node(Mono a, Lazy b): val(a), lazy(b) {;}
    Node operator += (const Lazy& x) { return *this = Node(val + x, lazy + x); }
    Node operator + (const Node& x) const { return Node(x.val + val, Lazy()); }
  };
  
  vector<Node> aint;
  
  int n, L_limit, R_limit;
  
  void init(int _n) {
    n = _n;
    L_limit = 1;
    R_limit = n;
    aint.resize(2 * n + 5, Node(ID_M, ID_L));
    fill(all(aint), Node(ID_M, ID_L));
  }
  
  void init(int L, int R) {
    n = R - L + 1;
    L_limit = L;
    R_limit = R;
    aint.resize(2 * n + 5, Node(ID_M, ID_L));
    fill(all(aint), Node(ID_M, ID_L));
  }
  
  void push(int node, int L, int R) {
    if(aint[node].lazy != ID_L)
    aint[L] += aint[node].lazy;
    aint[R] += aint[node].lazy;
    aint[node].lazy = ID_L;
  }
  
  tii get_sons(int node, int cl, int cr) {
    return {cl + cr >> 1, node + 1, node + ((cl + cr >> 1) - cl + 1) * 2};
  }
  
  template<typename VecType>
  void write(const VecType& v) {
    write<VecType>(v, 1, 1, n);
  }
  
  template<typename VecType>
  void write(const VecType& v, int node, int cl, int cr) {
    if(cl == cr) {
      aint[node].val = v[cl];
      aint[node].lazy = ID_L;
      return;
    }
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    write(v, L, cl, mid);
    write(v, R, mid + 1, cr);
    
    aint[node] = aint[L] + aint[R];
    return;
    
  }
  
  void set(int p, Mono val) { set(p, val, 1, L_limit, R_limit); }
  
  void set(int p, Mono val, int node, int cl, int cr) {
    if(cr < p || p < cl) return;
    if(cl == cr) { aint[node].val = val; return; }
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    push(node, L, R);
    
    set(p, val, L, cl, mid);
    set(p, val, R, mid + 1, cr);
    aint[node] = aint[L] + aint[R];
    
    return;
  }
  
  void upd(int l, int r, Lazy x) { upd(l, r, x, 1, L_limit, R_limit); }
  
  void upd(int l, int r, Lazy x, int node, int cl, int cr) {
    if(cr < l || r < cl) return;
    if(l <= cl && cr <= r) {
      aint[node] += x;
      return;
    }
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    push(node, L, R);
    
    upd(l, r, x, L, cl, mid);
    upd(l, r, x, R, mid + 1, cr);
    aint[node] = aint[L] + aint[R];
    
    return;
  }
  
  Mono query(int l, int r) { return query(l, r, 1, L_limit, R_limit); }
  
  Mono query(int l, int r, int node, int cl, int cr) {
    if(cr < l || r < cl) return ID_M;
    if(l <= cl && cr <= r) return aint[node].val;
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    push(node, L, R);
    
    return query(l, r, L, cl, mid) + query(l, r, R, mid + 1, cr);
  }
  
  template<class CB>
  int find_right(CB&& cb) { return find_right(cb, 1, L_limit, R_limit); }
  
  template<class CB>
  int find_right(CB&& cb, int node, int cl, int cr) {
    if(!cb(aint[node].val, cl, cr)) return cr + 1;
    if(cl == cr) return cl;
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    push(node, L, R);
    
    int tmp_rez = find_right(cb, L, cl, mid);
    if(tmp_rez == mid + 1) return find_right(cb, R, mid + 1, cr);
    return tmp_rez;
  }
  
  template<class CB>
  int find_left(CB&& cb) { return find_right(cb, 1, L_limit, R_limit); }  
  
  template<class CB>
  int find_left(CB&& cb, int node, int cl, int cr) {
    if(!cb(aint[node].val, cl, cr)) return cl - 1;
    if(cl == cr) return cl;
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    push(node, L, R);
    
    int tmp_rez = find_right(cb, R, mid + 1, cr);
    if(tmp_rez == mid) return find_right(cb, L, cl, mid);
    return tmp_rez;
  }
  
  void print(int node, int cl, int cr) {
    if(cl == cr) {
      fprintf(stderr, "(%d, %d) ", aint[node].val.simple, aint[node].val.active);
      return;
    }
    
    auto [mid, L, R] = get_sons(node, cl, cr);
    
    push(node, L, R);
    
    print(L, cl, mid);
    print(R, mid + 1, cr);
    return;
  }
  
};

struct EMPT {
  EMPT operator +(const EMPT& x) const {return EMPT(); }
  bool operator != (const EMPT& x) const { return 0; }
};

struct Node {
  ll simple;
  ll active;
  
  Node(): simple(0), active(0) {;}
  Node(ll a, ll b): simple(a), active(b) {;}
  
  Node operator +(const Node& x) const { return Node(simple + x.simple, active + x.active); }
  Node operator +(const EMPT& x) const { return *this; }
};

const int nmax = 1e6 + 5;

ll A[nmax], ALimit[nmax], AScore[nmax];
ll B[nmax], BLimit[nmax], BScore[nmax];

vector<pii> eventscol[nmax];

//ll dp[nmax][nmax];

signed main() {
  cin.tie(0) -> sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  
  AINT<Node,EMPT> aint;
  aint.init(1, n); // stocam derivata s_i - s_i-1
  
  for(int i = 1; i <= n; i++)
    cin >> A[i] >> ALimit[i] >> AScore[i];
  
  for(int i = 1; i <= m; i++)
    cin >> B[i] >> BLimit[i] >> BScore[i];
  
  for(int i = 1; i <= n; i++) A[i] += A[i - 1];
  for(int i = 1; i <= m; i++) B[i] += B[i - 1];
  
  ll _0 = 0;
  
  auto pushLineMod = [&](int ptr, int C) {
    auto R = aint.query(ptr, ptr);
    R.active += C;
    aint.set(ptr, R);
  };
  
  auto pushColMod = [&](int ptr, int C) {
    auto R = aint.query(ptr, ptr);
    R.simple += C;
    aint.set(ptr, R);
  };
  
  for(int i = 1; i <= n; i++) {
    if(ALimit[i] < A[i] || AScore[i] == 0) continue;
    int u = distance(B, upper_bound(B, B + m + 1, ALimit[i] - A[i])) - 1;
    
    if(AScore[i] < 0) {
      //if(u + 1 <= m)
        _0 += AScore[i],
        eventscol[u + 1].emplace_back(i, -AScore[i]);
    }
    else {
      eventscol[0].emplace_back(i, AScore[i]);
      eventscol[u + 1].emplace_back(i, -AScore[i]);
    }
  }
  
  auto proccess_i = [&](int i) {
    sort(all(eventscol[i]), [&](auto a, auto b) { return a.second < b.second; });
    
    for(auto [ptr, C] : eventscol[i]) {
      if(C > 0) {
        
        int cpy = C;
        
        auto finder = [&](Node val, int cl, int cr) -> bool {
          if(cr < ptr) return 0;
          if(val.simple > 0) return 1;
          return 0;
        };
        
        while(1) {
          int nv_ptr = aint.find_right(finder);
          if(nv_ptr == n + 1) break;
          
          auto R = aint.query(nv_ptr, nv_ptr);
          int mn = min(C,  R.simple);
          C -= mn;
          R.simple -= mn;
          aint.set(nv_ptr, R);
          
          if(C == 0) break;
          ptr = nv_ptr;
        }
        
        pushLineMod(ptr, cpy);
      }
      else
        pushLineMod(ptr, C),
        pushColMod(ptr, -C);
    }
  };
  
  for(int i = 0; i <= m; i++) {
    
    if(i == 0 || BScore[i] == 0 || BLimit[i] < B[i]) {
      proccess_i(i);
      continue;
    }
    
    int u = distance(A, upper_bound(A, A + n + 1, BLimit[i] - B[i])) - 1;
     
    _0 += BScore[i];
      
    if(u == n) {
      proccess_i(i);
      continue;
    }
    
    if(BScore[i] < 0) {
      pushColMod(u + 1, -BScore[i]);
      proccess_i(i);
    }
    else {
      proccess_i(i);
      auto finder = [&](Node val, int cl, int cr) -> bool {
        if(cr <= u) return 0;
        if(val.simple > 0) return 1;
        return 0;
      };
      
      while(1) {
        int nv_u = aint.find_right(finder);
        if(nv_u == n + 1) break;
        
        auto R = aint.query(nv_u, nv_u);
        int mn = min(BScore[i], R.simple);
        BScore[i] -= mn;
        R.simple -= mn;
        aint.set(nv_u, R);
        
        if(BScore[i] == 0) break;
        u = nv_u;
      }
    }
    
  }
  
  auto R = aint.query(1, n);
  
  
  cout << _0 + R.simple + R.active << '\n';

  
}

/**
  Anul asta nu se da centroid
  -- Rugaciunile mele
*/

Compilation message

dishes.cpp: In instantiation of 'tii AINT<Mono, Lazy>::get_sons(ll, ll, ll) [with Mono = Node; Lazy = EMPT; tii = std::tuple<long long int, long long int, long long int>; ll = long long int]':
dishes.cpp:125:24:   required from 'Mono AINT<Mono, Lazy>::query(ll, ll, ll, ll, ll) [with Mono = Node; Lazy = EMPT; ll = long long int]'
dishes.cpp:119:42:   required from 'Mono AINT<Mono, Lazy>::query(ll, ll) [with Mono = Node; Lazy = EMPT; ll = long long int]'
dishes.cpp:228:33:   required from here
dishes.cpp:56:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |     return {cl + cr >> 1, node + 1, node + ((cl + cr >> 1) - cl + 1) * 2};
      |             ~~~^~~~
dishes.cpp:56:49: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |     return {cl + cr >> 1, node + 1, node + ((cl + cr >> 1) - cl + 1) * 2};
      |                                              ~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 64364 KB Output is correct
2 Correct 338 ms 64192 KB Output is correct
3 Correct 194 ms 64676 KB Output is correct
4 Correct 273 ms 60616 KB Output is correct
5 Correct 8 ms 35420 KB Output is correct
6 Correct 350 ms 63376 KB Output is correct
7 Correct 57 ms 39336 KB Output is correct
8 Correct 140 ms 58560 KB Output is correct
9 Correct 197 ms 63412 KB Output is correct
10 Correct 381 ms 65232 KB Output is correct
11 Correct 164 ms 63152 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 7 ms 35492 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 6 ms 35496 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35424 KB Output is correct
10 Correct 8 ms 35420 KB Output is correct
11 Correct 7 ms 35676 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35420 KB Output is correct
14 Correct 6 ms 35420 KB Output is correct
15 Correct 6 ms 35400 KB Output is correct
16 Correct 7 ms 35496 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 7 ms 35492 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 6 ms 35496 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35424 KB Output is correct
10 Correct 8 ms 35420 KB Output is correct
11 Correct 7 ms 35676 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35420 KB Output is correct
14 Correct 6 ms 35420 KB Output is correct
15 Correct 6 ms 35400 KB Output is correct
16 Correct 7 ms 35496 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 10 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37636 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37724 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 7 ms 35492 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 6 ms 35496 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35424 KB Output is correct
10 Correct 8 ms 35420 KB Output is correct
11 Correct 7 ms 35676 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35420 KB Output is correct
14 Correct 6 ms 35420 KB Output is correct
15 Correct 6 ms 35400 KB Output is correct
16 Correct 7 ms 35496 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 10 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37636 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37724 KB Output is correct
24 Correct 241 ms 63432 KB Output is correct
25 Correct 128 ms 58300 KB Output is correct
26 Correct 243 ms 65212 KB Output is correct
27 Correct 131 ms 58296 KB Output is correct
28 Correct 216 ms 61700 KB Output is correct
29 Correct 149 ms 62380 KB Output is correct
30 Correct 428 ms 63436 KB Output is correct
31 Correct 51 ms 39516 KB Output is correct
32 Correct 145 ms 59244 KB Output is correct
33 Correct 299 ms 59120 KB Output is correct
34 Correct 316 ms 63696 KB Output is correct
35 Correct 412 ms 63820 KB Output is correct
36 Correct 405 ms 64708 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 7 ms 35492 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 6 ms 35496 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35424 KB Output is correct
10 Correct 8 ms 35420 KB Output is correct
11 Correct 7 ms 35676 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35420 KB Output is correct
14 Correct 6 ms 35420 KB Output is correct
15 Correct 6 ms 35400 KB Output is correct
16 Correct 7 ms 35496 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 10 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37636 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37724 KB Output is correct
24 Correct 241 ms 63432 KB Output is correct
25 Correct 128 ms 58300 KB Output is correct
26 Correct 243 ms 65212 KB Output is correct
27 Correct 131 ms 58296 KB Output is correct
28 Correct 216 ms 61700 KB Output is correct
29 Correct 149 ms 62380 KB Output is correct
30 Correct 428 ms 63436 KB Output is correct
31 Correct 51 ms 39516 KB Output is correct
32 Correct 145 ms 59244 KB Output is correct
33 Correct 299 ms 59120 KB Output is correct
34 Correct 316 ms 63696 KB Output is correct
35 Correct 412 ms 63820 KB Output is correct
36 Correct 405 ms 64708 KB Output is correct
37 Correct 287 ms 64704 KB Output is correct
38 Correct 161 ms 58300 KB Output is correct
39 Correct 368 ms 64448 KB Output is correct
40 Correct 405 ms 64448 KB Output is correct
41 Correct 7 ms 35416 KB Output is correct
42 Correct 537 ms 64720 KB Output is correct
43 Correct 336 ms 59076 KB Output is correct
44 Correct 399 ms 62936 KB Output is correct
45 Correct 523 ms 63680 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 7 ms 35492 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35420 KB Output is correct
7 Correct 6 ms 35496 KB Output is correct
8 Correct 7 ms 35420 KB Output is correct
9 Correct 7 ms 35424 KB Output is correct
10 Correct 8 ms 35420 KB Output is correct
11 Correct 7 ms 35676 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35420 KB Output is correct
14 Correct 6 ms 35420 KB Output is correct
15 Correct 6 ms 35400 KB Output is correct
16 Correct 7 ms 35496 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 10 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37636 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37724 KB Output is correct
24 Correct 241 ms 63432 KB Output is correct
25 Correct 128 ms 58300 KB Output is correct
26 Correct 243 ms 65212 KB Output is correct
27 Correct 131 ms 58296 KB Output is correct
28 Correct 216 ms 61700 KB Output is correct
29 Correct 149 ms 62380 KB Output is correct
30 Correct 428 ms 63436 KB Output is correct
31 Correct 51 ms 39516 KB Output is correct
32 Correct 145 ms 59244 KB Output is correct
33 Correct 299 ms 59120 KB Output is correct
34 Correct 316 ms 63696 KB Output is correct
35 Correct 412 ms 63820 KB Output is correct
36 Correct 405 ms 64708 KB Output is correct
37 Correct 287 ms 64704 KB Output is correct
38 Correct 161 ms 58300 KB Output is correct
39 Correct 368 ms 64448 KB Output is correct
40 Correct 405 ms 64448 KB Output is correct
41 Correct 7 ms 35416 KB Output is correct
42 Correct 537 ms 64720 KB Output is correct
43 Correct 336 ms 59076 KB Output is correct
44 Correct 399 ms 62936 KB Output is correct
45 Correct 523 ms 63680 KB Output is correct
46 Correct 1671 ms 165036 KB Output is correct
47 Correct 933 ms 133540 KB Output is correct
48 Correct 1904 ms 165052 KB Output is correct
49 Correct 2340 ms 165228 KB Output is correct
50 Correct 3839 ms 160496 KB Output is correct
51 Correct 2013 ms 134836 KB Output is correct
52 Correct 2391 ms 156532 KB Output is correct
53 Correct 3513 ms 159164 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 64364 KB Output is correct
2 Correct 338 ms 64192 KB Output is correct
3 Correct 194 ms 64676 KB Output is correct
4 Correct 273 ms 60616 KB Output is correct
5 Correct 8 ms 35420 KB Output is correct
6 Correct 350 ms 63376 KB Output is correct
7 Correct 57 ms 39336 KB Output is correct
8 Correct 140 ms 58560 KB Output is correct
9 Correct 197 ms 63412 KB Output is correct
10 Correct 381 ms 65232 KB Output is correct
11 Correct 164 ms 63152 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35492 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35420 KB Output is correct
16 Correct 7 ms 35420 KB Output is correct
17 Correct 7 ms 35420 KB Output is correct
18 Correct 6 ms 35496 KB Output is correct
19 Correct 7 ms 35420 KB Output is correct
20 Correct 7 ms 35424 KB Output is correct
21 Correct 8 ms 35420 KB Output is correct
22 Correct 7 ms 35676 KB Output is correct
23 Correct 7 ms 35420 KB Output is correct
24 Correct 7 ms 35420 KB Output is correct
25 Correct 6 ms 35420 KB Output is correct
26 Correct 6 ms 35400 KB Output is correct
27 Correct 7 ms 35496 KB Output is correct
28 Correct 9 ms 37724 KB Output is correct
29 Correct 8 ms 37468 KB Output is correct
30 Correct 10 ms 37720 KB Output is correct
31 Correct 9 ms 37468 KB Output is correct
32 Correct 9 ms 37636 KB Output is correct
33 Correct 9 ms 37724 KB Output is correct
34 Correct 11 ms 37724 KB Output is correct
35 Correct 241 ms 63432 KB Output is correct
36 Correct 128 ms 58300 KB Output is correct
37 Correct 243 ms 65212 KB Output is correct
38 Correct 131 ms 58296 KB Output is correct
39 Correct 216 ms 61700 KB Output is correct
40 Correct 149 ms 62380 KB Output is correct
41 Correct 428 ms 63436 KB Output is correct
42 Correct 51 ms 39516 KB Output is correct
43 Correct 145 ms 59244 KB Output is correct
44 Correct 299 ms 59120 KB Output is correct
45 Correct 316 ms 63696 KB Output is correct
46 Correct 412 ms 63820 KB Output is correct
47 Correct 405 ms 64708 KB Output is correct
48 Correct 287 ms 64704 KB Output is correct
49 Correct 161 ms 58300 KB Output is correct
50 Correct 368 ms 64448 KB Output is correct
51 Correct 405 ms 64448 KB Output is correct
52 Correct 7 ms 35416 KB Output is correct
53 Correct 537 ms 64720 KB Output is correct
54 Correct 336 ms 59076 KB Output is correct
55 Correct 399 ms 62936 KB Output is correct
56 Correct 523 ms 63680 KB Output is correct
57 Correct 170 ms 61260 KB Output is correct
58 Correct 162 ms 57308 KB Output is correct
59 Correct 385 ms 64444 KB Output is correct
60 Correct 252 ms 73312 KB Output is correct
61 Correct 94 ms 65616 KB Output is correct
62 Correct 7 ms 35420 KB Output is correct
63 Correct 524 ms 80064 KB Output is correct
64 Correct 331 ms 72924 KB Output is correct
65 Correct 444 ms 74688 KB Output is correct
66 Correct 504 ms 69828 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 64364 KB Output is correct
2 Correct 338 ms 64192 KB Output is correct
3 Correct 194 ms 64676 KB Output is correct
4 Correct 273 ms 60616 KB Output is correct
5 Correct 8 ms 35420 KB Output is correct
6 Correct 350 ms 63376 KB Output is correct
7 Correct 57 ms 39336 KB Output is correct
8 Correct 140 ms 58560 KB Output is correct
9 Correct 197 ms 63412 KB Output is correct
10 Correct 381 ms 65232 KB Output is correct
11 Correct 164 ms 63152 KB Output is correct
12 Correct 7 ms 35420 KB Output is correct
13 Correct 7 ms 35492 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35420 KB Output is correct
16 Correct 7 ms 35420 KB Output is correct
17 Correct 7 ms 35420 KB Output is correct
18 Correct 6 ms 35496 KB Output is correct
19 Correct 7 ms 35420 KB Output is correct
20 Correct 7 ms 35424 KB Output is correct
21 Correct 8 ms 35420 KB Output is correct
22 Correct 7 ms 35676 KB Output is correct
23 Correct 7 ms 35420 KB Output is correct
24 Correct 7 ms 35420 KB Output is correct
25 Correct 6 ms 35420 KB Output is correct
26 Correct 6 ms 35400 KB Output is correct
27 Correct 7 ms 35496 KB Output is correct
28 Correct 9 ms 37724 KB Output is correct
29 Correct 8 ms 37468 KB Output is correct
30 Correct 10 ms 37720 KB Output is correct
31 Correct 9 ms 37468 KB Output is correct
32 Correct 9 ms 37636 KB Output is correct
33 Correct 9 ms 37724 KB Output is correct
34 Correct 11 ms 37724 KB Output is correct
35 Correct 241 ms 63432 KB Output is correct
36 Correct 128 ms 58300 KB Output is correct
37 Correct 243 ms 65212 KB Output is correct
38 Correct 131 ms 58296 KB Output is correct
39 Correct 216 ms 61700 KB Output is correct
40 Correct 149 ms 62380 KB Output is correct
41 Correct 428 ms 63436 KB Output is correct
42 Correct 51 ms 39516 KB Output is correct
43 Correct 145 ms 59244 KB Output is correct
44 Correct 299 ms 59120 KB Output is correct
45 Correct 316 ms 63696 KB Output is correct
46 Correct 412 ms 63820 KB Output is correct
47 Correct 405 ms 64708 KB Output is correct
48 Correct 287 ms 64704 KB Output is correct
49 Correct 161 ms 58300 KB Output is correct
50 Correct 368 ms 64448 KB Output is correct
51 Correct 405 ms 64448 KB Output is correct
52 Correct 7 ms 35416 KB Output is correct
53 Correct 537 ms 64720 KB Output is correct
54 Correct 336 ms 59076 KB Output is correct
55 Correct 399 ms 62936 KB Output is correct
56 Correct 523 ms 63680 KB Output is correct
57 Correct 1671 ms 165036 KB Output is correct
58 Correct 933 ms 133540 KB Output is correct
59 Correct 1904 ms 165052 KB Output is correct
60 Correct 2340 ms 165228 KB Output is correct
61 Correct 3839 ms 160496 KB Output is correct
62 Correct 2013 ms 134836 KB Output is correct
63 Correct 2391 ms 156532 KB Output is correct
64 Correct 3513 ms 159164 KB Output is correct
65 Correct 170 ms 61260 KB Output is correct
66 Correct 162 ms 57308 KB Output is correct
67 Correct 385 ms 64444 KB Output is correct
68 Correct 252 ms 73312 KB Output is correct
69 Correct 94 ms 65616 KB Output is correct
70 Correct 7 ms 35420 KB Output is correct
71 Correct 524 ms 80064 KB Output is correct
72 Correct 331 ms 72924 KB Output is correct
73 Correct 444 ms 74688 KB Output is correct
74 Correct 504 ms 69828 KB Output is correct
75 Correct 908 ms 220916 KB Output is correct
76 Correct 829 ms 199560 KB Output is correct
77 Correct 2186 ms 223636 KB Output is correct
78 Correct 1474 ms 207696 KB Output is correct
79 Correct 3857 ms 225872 KB Output is correct
80 Correct 2080 ms 205772 KB Output is correct
81 Correct 2723 ms 219516 KB Output is correct
82 Correct 3536 ms 195452 KB Output is correct
83 Correct 3435 ms 214452 KB Output is correct