oj.uz

답안 #897883

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897883 2024-01-03T22:50:23 Z cadmiumsky Two Dishes (JOI19_dishes) C++17
74 / 100
 3672 ms 164948 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 338 ms 64448 KB Output is correct
2 Correct 335 ms 62656 KB Output is correct
3 Correct 192 ms 62384 KB Output is correct
4 Correct 258 ms 60308 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 355 ms 62632 KB Output is correct
7 Correct 57 ms 39504 KB Output is correct
8 Correct 151 ms 59312 KB Output is correct
9 Correct 200 ms 62384 KB Output is correct
10 Correct 375 ms 64448 KB Output is correct
11 Correct 165 ms 63936 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35416 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 6 ms 35420 KB Output is correct
4 Correct 6 ms 35420 KB Output is correct
5 Correct 8 ms 35420 KB Output is correct
6 Correct 7 ms 35416 KB Output is correct
7 Correct 6 ms 35420 KB Output is correct
8 Correct 7 ms 35496 KB Output is correct
9 Correct 6 ms 35420 KB Output is correct
10 Correct 7 ms 35428 KB Output is correct
11 Correct 6 ms 35420 KB Output is correct
12 Correct 7 ms 35476 KB Output is correct
13 Correct 6 ms 35420 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35740 KB Output is correct
16 Correct 7 ms 35420 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 9 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37724 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37720 KB Output is correct
24 Correct 236 ms 64436 KB Output is correct
25 Correct 123 ms 58304 KB Output is correct
26 Correct 241 ms 64464 KB Output is correct
27 Correct 135 ms 58560 KB Output is correct
28 Correct 226 ms 63240 KB Output is correct
29 Correct 149 ms 63944 KB Output is correct
30 Correct 430 ms 64188 KB Output is correct
31 Correct 50 ms 39508 KB Output is correct
32 Correct 143 ms 59176 KB Output is correct
33 Correct 261 ms 59328 KB Output is correct
34 Correct 313 ms 62908 KB Output is correct
35 Correct 402 ms 63424 KB Output is correct
36 Correct 402 ms 64464 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35416 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 6 ms 35420 KB Output is correct
4 Correct 6 ms 35420 KB Output is correct
5 Correct 8 ms 35420 KB Output is correct
6 Correct 7 ms 35416 KB Output is correct
7 Correct 6 ms 35420 KB Output is correct
8 Correct 7 ms 35496 KB Output is correct
9 Correct 6 ms 35420 KB Output is correct
10 Correct 7 ms 35428 KB Output is correct
11 Correct 6 ms 35420 KB Output is correct
12 Correct 7 ms 35476 KB Output is correct
13 Correct 6 ms 35420 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35740 KB Output is correct
16 Correct 7 ms 35420 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 9 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37724 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37720 KB Output is correct
24 Correct 236 ms 64436 KB Output is correct
25 Correct 123 ms 58304 KB Output is correct
26 Correct 241 ms 64464 KB Output is correct
27 Correct 135 ms 58560 KB Output is correct
28 Correct 226 ms 63240 KB Output is correct
29 Correct 149 ms 63944 KB Output is correct
30 Correct 430 ms 64188 KB Output is correct
31 Correct 50 ms 39508 KB Output is correct
32 Correct 143 ms 59176 KB Output is correct
33 Correct 261 ms 59328 KB Output is correct
34 Correct 313 ms 62908 KB Output is correct
35 Correct 402 ms 63424 KB Output is correct
36 Correct 402 ms 64464 KB Output is correct
37 Correct 297 ms 64440 KB Output is correct
38 Correct 161 ms 58296 KB Output is correct
39 Correct 348 ms 64460 KB Output is correct
40 Correct 397 ms 64444 KB Output is correct
41 Correct 6 ms 35420 KB Output is correct
42 Correct 615 ms 63448 KB Output is correct
43 Correct 324 ms 59044 KB Output is correct
44 Correct 394 ms 62912 KB Output is correct
45 Correct 514 ms 64448 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 35416 KB Output is correct
2 Correct 7 ms 35420 KB Output is correct
3 Correct 6 ms 35420 KB Output is correct
4 Correct 6 ms 35420 KB Output is correct
5 Correct 8 ms 35420 KB Output is correct
6 Correct 7 ms 35416 KB Output is correct
7 Correct 6 ms 35420 KB Output is correct
8 Correct 7 ms 35496 KB Output is correct
9 Correct 6 ms 35420 KB Output is correct
10 Correct 7 ms 35428 KB Output is correct
11 Correct 6 ms 35420 KB Output is correct
12 Correct 7 ms 35476 KB Output is correct
13 Correct 6 ms 35420 KB Output is correct
14 Correct 7 ms 35420 KB Output is correct
15 Correct 7 ms 35740 KB Output is correct
16 Correct 7 ms 35420 KB Output is correct
17 Correct 9 ms 37724 KB Output is correct
18 Correct 8 ms 37468 KB Output is correct
19 Correct 9 ms 37720 KB Output is correct
20 Correct 9 ms 37468 KB Output is correct
21 Correct 9 ms 37724 KB Output is correct
22 Correct 9 ms 37724 KB Output is correct
23 Correct 11 ms 37720 KB Output is correct
24 Correct 236 ms 64436 KB Output is correct
25 Correct 123 ms 58304 KB Output is correct
26 Correct 241 ms 64464 KB Output is correct
27 Correct 135 ms 58560 KB Output is correct
28 Correct 226 ms 63240 KB Output is correct
29 Correct 149 ms 63944 KB Output is correct
30 Correct 430 ms 64188 KB Output is correct
31 Correct 50 ms 39508 KB Output is correct
32 Correct 143 ms 59176 KB Output is correct
33 Correct 261 ms 59328 KB Output is correct
34 Correct 313 ms 62908 KB Output is correct
35 Correct 402 ms 63424 KB Output is correct
36 Correct 402 ms 64464 KB Output is correct
37 Correct 297 ms 64440 KB Output is correct
38 Correct 161 ms 58296 KB Output is correct
39 Correct 348 ms 64460 KB Output is correct
40 Correct 397 ms 64444 KB Output is correct
41 Correct 6 ms 35420 KB Output is correct
42 Correct 615 ms 63448 KB Output is correct
43 Correct 324 ms 59044 KB Output is correct
44 Correct 394 ms 62912 KB Output is correct
45 Correct 514 ms 64448 KB Output is correct
46 Correct 1686 ms 164788 KB Output is correct
47 Correct 892 ms 134264 KB Output is correct
48 Correct 1826 ms 164784 KB Output is correct
49 Correct 2264 ms 164948 KB Output is correct
50 Correct 3672 ms 159660 KB Output is correct
51 Correct 1990 ms 134772 KB Output is correct
52 Correct 2300 ms 157820 KB Output is correct
53 Correct 3414 ms 158968 KB Output is correct

Subtask #7
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 64448 KB Output is correct
2 Correct 335 ms 62656 KB Output is correct
3 Correct 192 ms 62384 KB Output is correct
4 Correct 258 ms 60308 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 355 ms 62632 KB Output is correct
7 Correct 57 ms 39504 KB Output is correct
8 Correct 151 ms 59312 KB Output is correct
9 Correct 200 ms 62384 KB Output is correct
10 Correct 375 ms 64448 KB Output is correct
11 Correct 165 ms 63936 KB Output is correct
12 Correct 7 ms 35416 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 35420 KB Output is correct
16 Correct 8 ms 35420 KB Output is correct
17 Correct 7 ms 35416 KB Output is correct
18 Correct 6 ms 35420 KB Output is correct
19 Correct 7 ms 35496 KB Output is correct
20 Correct 6 ms 35420 KB Output is correct
21 Correct 7 ms 35428 KB Output is correct
22 Correct 6 ms 35420 KB Output is correct
23 Correct 7 ms 35476 KB Output is correct
24 Correct 6 ms 35420 KB Output is correct
25 Correct 7 ms 35420 KB Output is correct
26 Correct 7 ms 35740 KB Output is correct
27 Correct 7 ms 35420 KB Output is correct
28 Correct 9 ms 37724 KB Output is correct
29 Correct 8 ms 37468 KB Output is correct
30 Correct 9 ms 37720 KB Output is correct
31 Correct 9 ms 37468 KB Output is correct
32 Correct 9 ms 37724 KB Output is correct
33 Correct 9 ms 37724 KB Output is correct
34 Correct 11 ms 37720 KB Output is correct
35 Correct 236 ms 64436 KB Output is correct
36 Correct 123 ms 58304 KB Output is correct
37 Correct 241 ms 64464 KB Output is correct
38 Correct 135 ms 58560 KB Output is correct
39 Correct 226 ms 63240 KB Output is correct
40 Correct 149 ms 63944 KB Output is correct
41 Correct 430 ms 64188 KB Output is correct
42 Correct 50 ms 39508 KB Output is correct
43 Correct 143 ms 59176 KB Output is correct
44 Correct 261 ms 59328 KB Output is correct
45 Correct 313 ms 62908 KB Output is correct
46 Correct 402 ms 63424 KB Output is correct
47 Correct 402 ms 64464 KB Output is correct
48 Correct 297 ms 64440 KB Output is correct
49 Correct 161 ms 58296 KB Output is correct
50 Correct 348 ms 64460 KB Output is correct
51 Correct 397 ms 64444 KB Output is correct
52 Correct 6 ms 35420 KB Output is correct
53 Correct 615 ms 63448 KB Output is correct
54 Correct 324 ms 59044 KB Output is correct
55 Correct 394 ms 62912 KB Output is correct
56 Correct 514 ms 64448 KB Output is correct
57 Correct 170 ms 61264 KB Output is correct
58 Correct 161 ms 57296 KB Output is correct
59 Incorrect 387 ms 65244 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 64448 KB Output is correct
2 Correct 335 ms 62656 KB Output is correct
3 Correct 192 ms 62384 KB Output is correct
4 Correct 258 ms 60308 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 355 ms 62632 KB Output is correct
7 Correct 57 ms 39504 KB Output is correct
8 Correct 151 ms 59312 KB Output is correct
9 Correct 200 ms 62384 KB Output is correct
10 Correct 375 ms 64448 KB Output is correct
11 Correct 165 ms 63936 KB Output is correct
12 Correct 7 ms 35416 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 35420 KB Output is correct
16 Correct 8 ms 35420 KB Output is correct
17 Correct 7 ms 35416 KB Output is correct
18 Correct 6 ms 35420 KB Output is correct
19 Correct 7 ms 35496 KB Output is correct
20 Correct 6 ms 35420 KB Output is correct
21 Correct 7 ms 35428 KB Output is correct
22 Correct 6 ms 35420 KB Output is correct
23 Correct 7 ms 35476 KB Output is correct
24 Correct 6 ms 35420 KB Output is correct
25 Correct 7 ms 35420 KB Output is correct
26 Correct 7 ms 35740 KB Output is correct
27 Correct 7 ms 35420 KB Output is correct
28 Correct 9 ms 37724 KB Output is correct
29 Correct 8 ms 37468 KB Output is correct
30 Correct 9 ms 37720 KB Output is correct
31 Correct 9 ms 37468 KB Output is correct
32 Correct 9 ms 37724 KB Output is correct
33 Correct 9 ms 37724 KB Output is correct
34 Correct 11 ms 37720 KB Output is correct
35 Correct 236 ms 64436 KB Output is correct
36 Correct 123 ms 58304 KB Output is correct
37 Correct 241 ms 64464 KB Output is correct
38 Correct 135 ms 58560 KB Output is correct
39 Correct 226 ms 63240 KB Output is correct
40 Correct 149 ms 63944 KB Output is correct
41 Correct 430 ms 64188 KB Output is correct
42 Correct 50 ms 39508 KB Output is correct
43 Correct 143 ms 59176 KB Output is correct
44 Correct 261 ms 59328 KB Output is correct
45 Correct 313 ms 62908 KB Output is correct
46 Correct 402 ms 63424 KB Output is correct
47 Correct 402 ms 64464 KB Output is correct
48 Correct 297 ms 64440 KB Output is correct
49 Correct 161 ms 58296 KB Output is correct
50 Correct 348 ms 64460 KB Output is correct
51 Correct 397 ms 64444 KB Output is correct
52 Correct 6 ms 35420 KB Output is correct
53 Correct 615 ms 63448 KB Output is correct
54 Correct 324 ms 59044 KB Output is correct
55 Correct 394 ms 62912 KB Output is correct
56 Correct 514 ms 64448 KB Output is correct
57 Correct 1686 ms 164788 KB Output is correct
58 Correct 892 ms 134264 KB Output is correct
59 Correct 1826 ms 164784 KB Output is correct
60 Correct 2264 ms 164948 KB Output is correct
61 Correct 3672 ms 159660 KB Output is correct
62 Correct 1990 ms 134772 KB Output is correct
63 Correct 2300 ms 157820 KB Output is correct
64 Correct 3414 ms 158968 KB Output is correct
65 Correct 170 ms 61264 KB Output is correct
66 Correct 161 ms 57296 KB Output is correct
67 Incorrect 387 ms 65244 KB Output isn't correct
68 Halted 0 ms 0 KB -