oj.uz

Submission #771069

# Submission time Handle Problem Language Result Execution time Memory
771069 2023-07-02T12:16:58 Z Sam_a17 Financial Report (JOI21_financial) C++17
100 / 100
 485 ms 45544 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 = 3e5 + 10;

struct segTree {
  vector<long long> tree;
  int size = 1;
 
  void init(int s) {
    while(size <= s) {
      size *= 2;
    }
    tree.assign(2 * size - 1, 0);
  }
 
  void upd(int u, int value, int x, int lx, int rx) {
    if(rx - lx == 1) {
      tree[x] = value;
      return;
    }
 
    int mid = (lx + rx) / 2;
    if(u < mid) {
      upd(u, value, 2 * x + 1, lx, mid);
    } else {
      upd(u, value, 2 * x + 2, mid, rx);
    }
 
    tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
  }
 
  void upd(int u, int value) {
    upd(u, value, 0, 0, size);
  }
 

  void get(int u, int x, int lx, int rx) { // set value at pos u
    if(rx - lx == 1) {
      // dbg(tree[x])
      return;
    }
 
    int m = (lx + rx) / 2;
    if(u < m) {
      get(u, 2 * x + 1, lx, m);
    }else {
      get(u, 2 * x + 2, m, rx);
    }
    tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
  }
 
  void get(int u) {
    get(u, 0, 0, size);
  }

  int find(int k, int l, int x, int lx, int rx) {
    if (tree[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(int k, int l) {
    return find(k, l, 0, 0, size);
  }
 
};
 

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) {
    return qry(l, r, 0, 0, size);
  }
};


segTreeMax seg_max;
segTree seg;


int a[N];
int n, d;

vector<int> adj[N];

int p[N], sz[N];
int l[N];

// dsu
void init() {
  for(int i = 0; i < n; i++) {
    p[i] = i, sz[i] = 1;
    l[i] = i;
  }
}

int find(int a) {
  if(a != p[a]) {
    p[a] = find(p[a]);
  }
  return p[a];
}

int same(int a, int b) {
  if(find(a) == find(b)) {
    return 1;
  }
  return 0;
}

int merge(int a, int b) {
  a = find(a), b = find(b);
  if(a == b) {
    return 0;
  }
  if(sz[b] > sz[a]) {
    swap(a, b);
  }
  p[b] = a, sz[a] += sz[b];
  l[a] = min(l[a], l[b]);
  return 1;
}


void solve_() {
  cin >> n >> d;

  vector<int> compress;
  for(int i = 0; i < n; i++) {
    cin >> a[i];
    compress.push_back(a[i]);
  }

  sort(all(compress));
  uniq(compress);

  for(int i = 0; i < n; i++) {
    a[i] = lower_bound(all(compress), a[i]) - compress.begin() + 1;
    adj[a[i]].push_back(i);
  }

  init();
  seg.init(n + 10);
  seg_max.init(n + 10);
  vector<int> cons(n + 3), on(n + 1);
  vector<int> dp(n + 1);
  int answ = 0;
  for(int i = n; i >= 1; i--) {
    // dbg(adj[i])
    for(auto j: adj[i]) {
      int max_ind = seg.find(d, j);
      if(max_ind == -1) {
        max_ind = n;
      } else {
        // dbg(max_ind)
        seg.get(1);
        max_ind += d - 1;
      }
      // dbg(max_ind)
      dp[j] = seg_max.qry(j, max_ind + 1) + 1;
      answ = max(answ, dp[j]);
      // dbg(dp[j])
      seg_max.upd(j, dp[j]);
      on[j] = true;
    }

    for(auto j: adj[i]) {
      if(on[j + 1]) {
        merge(j, j + 1);
        seg.upd(j + 1, 0);
      }

      if(j - 1 >= 0 && on[j - 1]) {
        merge(j - 1, j);
      }

      int cur = find(j);
      // dbg(l[cur])
      // dbg(sz[cur])
      seg.upd(l[cur], sz[cur]);
    }
  }

  cout << answ << '\n';
}

int main() {
  setIO();

  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:77:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:79:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:80:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7388 KB Output is correct
8 Correct 3 ms 7328 KB Output is correct
9 Correct 4 ms 7324 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7384 KB Output is correct
15 Correct 4 ms 7388 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 3 ms 7380 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 4 ms 7384 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7388 KB Output is correct
8 Correct 3 ms 7328 KB Output is correct
9 Correct 4 ms 7324 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7384 KB Output is correct
15 Correct 4 ms 7388 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 3 ms 7380 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 4 ms 7384 KB Output is correct
27 Correct 4 ms 7384 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 4 ms 7384 KB Output is correct
33 Correct 4 ms 7384 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 4 ms 7380 KB Output is correct
36 Correct 4 ms 7388 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 4 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 3 ms 7380 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7388 KB Output is correct
8 Correct 3 ms 7328 KB Output is correct
9 Correct 4 ms 7324 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7384 KB Output is correct
15 Correct 4 ms 7388 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 3 ms 7380 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 4 ms 7384 KB Output is correct
27 Correct 4 ms 7384 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 4 ms 7384 KB Output is correct
33 Correct 4 ms 7384 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 4 ms 7380 KB Output is correct
36 Correct 4 ms 7388 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 4 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 3 ms 7380 KB Output is correct
41 Correct 9 ms 8020 KB Output is correct
42 Correct 10 ms 8192 KB Output is correct
43 Correct 7 ms 7892 KB Output is correct
44 Correct 8 ms 8020 KB Output is correct
45 Correct 8 ms 7912 KB Output is correct
46 Correct 8 ms 8104 KB Output is correct
47 Correct 8 ms 8108 KB Output is correct
48 Correct 9 ms 8148 KB Output is correct
49 Correct 9 ms 8164 KB Output is correct
50 Correct 9 ms 8160 KB Output is correct
51 Correct 8 ms 8148 KB Output is correct
52 Correct 9 ms 8148 KB Output is correct
53 Correct 7 ms 8148 KB Output is correct
54 Correct 8 ms 8148 KB Output is correct
55 Correct 8 ms 8164 KB Output is correct
56 Correct 8 ms 8148 KB Output is correct
57 Correct 9 ms 8184 KB Output is correct
58 Correct 7 ms 8164 KB Output is correct
59 Correct 8 ms 8168 KB Output is correct
60 Correct 7 ms 8096 KB Output is correct
61 Correct 7 ms 8164 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 36416 KB Output is correct
2 Correct 190 ms 36196 KB Output is correct
3 Correct 289 ms 36156 KB Output is correct
4 Correct 459 ms 42236 KB Output is correct
5 Correct 339 ms 43800 KB Output is correct
6 Correct 453 ms 43736 KB Output is correct
7 Correct 207 ms 43560 KB Output is correct
8 Correct 152 ms 43808 KB Output is correct
9 Correct 222 ms 43852 KB Output is correct
10 Correct 215 ms 43852 KB Output is correct
11 Correct 313 ms 43856 KB Output is correct
12 Correct 319 ms 43852 KB Output is correct
13 Correct 337 ms 43812 KB Output is correct
14 Correct 357 ms 43816 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 36448 KB Output is correct
2 Correct 252 ms 35880 KB Output is correct
3 Correct 296 ms 36572 KB Output is correct
4 Correct 412 ms 43860 KB Output is correct
5 Correct 352 ms 43860 KB Output is correct
6 Correct 407 ms 43952 KB Output is correct
7 Correct 179 ms 43840 KB Output is correct
8 Correct 148 ms 43852 KB Output is correct
9 Correct 189 ms 43716 KB Output is correct
10 Correct 268 ms 43808 KB Output is correct
11 Correct 402 ms 43864 KB Output is correct
12 Correct 257 ms 43772 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 4 ms 7388 KB Output is correct
8 Correct 3 ms 7328 KB Output is correct
9 Correct 4 ms 7324 KB Output is correct
10 Correct 3 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 4 ms 7384 KB Output is correct
15 Correct 4 ms 7388 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 3 ms 7380 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 4 ms 7384 KB Output is correct
27 Correct 4 ms 7384 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 4 ms 7380 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 4 ms 7384 KB Output is correct
33 Correct 4 ms 7384 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 4 ms 7380 KB Output is correct
36 Correct 4 ms 7388 KB Output is correct
37 Correct 3 ms 7380 KB Output is correct
38 Correct 4 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 3 ms 7380 KB Output is correct
41 Correct 9 ms 8020 KB Output is correct
42 Correct 10 ms 8192 KB Output is correct
43 Correct 7 ms 7892 KB Output is correct
44 Correct 8 ms 8020 KB Output is correct
45 Correct 8 ms 7912 KB Output is correct
46 Correct 8 ms 8104 KB Output is correct
47 Correct 8 ms 8108 KB Output is correct
48 Correct 9 ms 8148 KB Output is correct
49 Correct 9 ms 8164 KB Output is correct
50 Correct 9 ms 8160 KB Output is correct
51 Correct 8 ms 8148 KB Output is correct
52 Correct 9 ms 8148 KB Output is correct
53 Correct 7 ms 8148 KB Output is correct
54 Correct 8 ms 8148 KB Output is correct
55 Correct 8 ms 8164 KB Output is correct
56 Correct 8 ms 8148 KB Output is correct
57 Correct 9 ms 8184 KB Output is correct
58 Correct 7 ms 8164 KB Output is correct
59 Correct 8 ms 8168 KB Output is correct
60 Correct 7 ms 8096 KB Output is correct
61 Correct 7 ms 8164 KB Output is correct
62 Correct 174 ms 36416 KB Output is correct
63 Correct 190 ms 36196 KB Output is correct
64 Correct 289 ms 36156 KB Output is correct
65 Correct 459 ms 42236 KB Output is correct
66 Correct 339 ms 43800 KB Output is correct
67 Correct 453 ms 43736 KB Output is correct
68 Correct 207 ms 43560 KB Output is correct
69 Correct 152 ms 43808 KB Output is correct
70 Correct 222 ms 43852 KB Output is correct
71 Correct 215 ms 43852 KB Output is correct
72 Correct 313 ms 43856 KB Output is correct
73 Correct 319 ms 43852 KB Output is correct
74 Correct 337 ms 43812 KB Output is correct
75 Correct 357 ms 43816 KB Output is correct
76 Correct 147 ms 36448 KB Output is correct
77 Correct 252 ms 35880 KB Output is correct
78 Correct 296 ms 36572 KB Output is correct
79 Correct 412 ms 43860 KB Output is correct
80 Correct 352 ms 43860 KB Output is correct
81 Correct 407 ms 43952 KB Output is correct
82 Correct 179 ms 43840 KB Output is correct
83 Correct 148 ms 43852 KB Output is correct
84 Correct 189 ms 43716 KB Output is correct
85 Correct 268 ms 43808 KB Output is correct
86 Correct 402 ms 43864 KB Output is correct
87 Correct 257 ms 43772 KB Output is correct
88 Correct 324 ms 36404 KB Output is correct
89 Correct 435 ms 43724 KB Output is correct
90 Correct 448 ms 37440 KB Output is correct
91 Correct 413 ms 45444 KB Output is correct
92 Correct 201 ms 38100 KB Output is correct
93 Correct 330 ms 37828 KB Output is correct
94 Correct 397 ms 42680 KB Output is correct
95 Correct 372 ms 45376 KB Output is correct
96 Correct 420 ms 45420 KB Output is correct
97 Correct 450 ms 45484 KB Output is correct
98 Correct 485 ms 45448 KB Output is correct
99 Correct 396 ms 45404 KB Output is correct
100 Correct 417 ms 45476 KB Output is correct
101 Correct 205 ms 45476 KB Output is correct
102 Correct 230 ms 45520 KB Output is correct
103 Correct 246 ms 45392 KB Output is correct
104 Correct 274 ms 45480 KB Output is correct
105 Correct 313 ms 45476 KB Output is correct
106 Correct 253 ms 45480 KB Output is correct
107 Correct 273 ms 45476 KB Output is correct
108 Correct 380 ms 45496 KB Output is correct
109 Correct 292 ms 45464 KB Output is correct
110 Correct 468 ms 45460 KB Output is correct
111 Correct 317 ms 45376 KB Output is correct
112 Correct 260 ms 45544 KB Output is correct
113 Correct 378 ms 45380 KB Output is correct
114 Correct 321 ms 45520 KB Output is correct
115 Correct 147 ms 45416 KB Output is correct
116 Correct 146 ms 45444 KB Output is correct
117 Correct 172 ms 45400 KB Output is correct
118 Correct 176 ms 45488 KB Output is correct
119 Correct 243 ms 45396 KB Output is correct
120 Correct 246 ms 45456 KB Output is correct