oj.uz

Submission #229910

# Submission time Handle Problem Language Result Execution time Memory
229910 2020-05-07T05:48:02 Z caoash Dreaming (IOI13_dreaming) C++14
65 / 100
 141 ms 16504 KB 
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include "dreaming.h"
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset
 
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
 
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
 
template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
 
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}
 
using namespace input;
 
namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
using namespace output;
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}
 
using namespace io;
 
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100005;
const ld PI = 4*atan((ld)1);
 
vpi adj[MX]; int dp1[MX], dp2[MX], ans[MX], val[MX], par[MX];
 
void dfs1(int v, int p){
   for(pi to : adj[v]){
      if(to.f != p){
         dfs1(to.f, v);
         dp1[v] = max(dp1[v], dp1[to.f]+to.s);
         val[to.f] = to.s;
         par[to.f] = v;
      }
   }
}
 
void dfs2(int v, int p){
   if(p != -1){
      dp2[v] = max(dp2[v], dp2[p]+val[v]);
      for(pi to2 : adj[p]){
         if(to2.f != v && to2.f != par[p]){
            dp2[v] = max(dp2[v], dp1[to2.f] + val[v] + to2.s);
         }
      }
 
   }
   for(pi to : adj[v]){
      if(to.f != p){
        dfs2(to.f, v);
      }
   }
}
bool vis[MX];
pi dfs_ans(int v, int p){
   vis[v] = true;
   pi ret = mp(max(dp1[v], dp2[v]), v);
   for(pi to : adj[v]){
      if(to.f != p){
         pi nxt = dfs_ans(to.f, v);
         ckmin(ret, nxt);
      }
   }
   return ret;
}
 
 
pi dfs(int v, int p, int d){
   pi best = mp(d,v);
   for(pi to : adj[v]){
     if(to.f != p){ 
        ckmax(best, dfs(to.f, v, d+to.s)); 
     }
   }
   return best;
}
 
int diam(int v, int p){
   pi far = dfs(0,-1, 0);
   return dfs(far.s, -1, 0).f;
}
 
int travelTime(int N, int M, int L, int a[], int b[], int c[]){
  fax(i,M){
   //dbg(a[i], b[i], c[i]);
   adj[a[i]].pb(mp(b[i],c[i]));
   adj[b[i]].pb(mp(a[i],c[i]));
  }
  vpi roots;
  fax(i,N){
   if(!vis[i]){
     dfs1(i,-1); dfs2(i,-1); 
     pi fin = dfs_ans(i,-1);
     roots.pb(mp(fin.f, fin.s));
   }
  }
  sort(all(roots));
  fax(i,sz(roots)-1){
   int u = roots[sz(roots)-1].s; int v = roots[i].s; int w = L;
   adj[u].pb(mp(v,w));
   adj[v].pb(mp(u,w));
  }
  if(sz(roots) <= 3){
     return diam(0,-1);
  }
  else{
     return max(roots[sz(roots)-3].f + roots[sz(roots)-2].f + 2*L, roots[sz(roots)-1].f + roots[sz(roots)-2].f + L);
  }
}

Compilation message

dreaming.cpp: In function 'void io::setIn(std::__cxx11::string)':
dreaming.cpp:134:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'void io::setOut(std::__cxx11::string)':
dreaming.cpp:135:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 15352 KB Output is correct
2 Correct 75 ms 15224 KB Output is correct
3 Correct 49 ms 10872 KB Output is correct
4 Correct 14 ms 4608 KB Output is correct
5 Correct 13 ms 3712 KB Output is correct
6 Correct 21 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 36 ms 6648 KB Output is correct
9 Correct 49 ms 8696 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 71 ms 10616 KB Output is correct
12 Correct 94 ms 11000 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 15352 KB Output is correct
2 Correct 75 ms 15224 KB Output is correct
3 Correct 49 ms 10872 KB Output is correct
4 Correct 14 ms 4608 KB Output is correct
5 Correct 13 ms 3712 KB Output is correct
6 Correct 21 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 36 ms 6648 KB Output is correct
9 Correct 49 ms 8696 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 71 ms 10616 KB Output is correct
12 Correct 94 ms 11000 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2688 KB Output is correct
15 Correct 6 ms 2688 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 6 ms 2688 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 6 ms 2688 KB Output is correct
23 Correct 6 ms 2816 KB Output is correct
24 Correct 6 ms 2688 KB Output is correct
25 Correct 6 ms 2688 KB Output is correct
26 Correct 6 ms 2688 KB Output is correct
27 Correct 6 ms 2688 KB Output is correct
28 Correct 6 ms 2688 KB Output is correct
29 Correct 6 ms 2688 KB Output is correct
30 Correct 6 ms 2688 KB Output is correct
31 Correct 6 ms 2688 KB Output is correct
32 Correct 6 ms 2688 KB Output is correct
33 Correct 6 ms 2688 KB Output is correct
34 Correct 7 ms 2688 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2688 KB Output is correct
37 Correct 6 ms 2688 KB Output is correct
38 Correct 6 ms 2688 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 15352 KB Output is correct
2 Correct 75 ms 15224 KB Output is correct
3 Correct 49 ms 10872 KB Output is correct
4 Correct 14 ms 4608 KB Output is correct
5 Correct 13 ms 3712 KB Output is correct
6 Correct 21 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 36 ms 6648 KB Output is correct
9 Correct 49 ms 8696 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 71 ms 10616 KB Output is correct
12 Correct 94 ms 11000 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2688 KB Output is correct
15 Correct 6 ms 2688 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 6 ms 2688 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 6 ms 2688 KB Output is correct
23 Correct 6 ms 2816 KB Output is correct
24 Correct 6 ms 2688 KB Output is correct
25 Correct 6 ms 2688 KB Output is correct
26 Correct 6 ms 2688 KB Output is correct
27 Correct 6 ms 2688 KB Output is correct
28 Correct 6 ms 2688 KB Output is correct
29 Correct 6 ms 2688 KB Output is correct
30 Correct 6 ms 2688 KB Output is correct
31 Correct 6 ms 2688 KB Output is correct
32 Correct 6 ms 2688 KB Output is correct
33 Correct 6 ms 2688 KB Output is correct
34 Correct 7 ms 2688 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2688 KB Output is correct
37 Correct 6 ms 2688 KB Output is correct
38 Correct 6 ms 2688 KB Output is correct
39 Correct 75 ms 15480 KB Output is correct
40 Correct 73 ms 15224 KB Output is correct
41 Correct 50 ms 11000 KB Output is correct
42 Correct 15 ms 4568 KB Output is correct
43 Correct 6 ms 2688 KB Output is correct
44 Correct 6 ms 2688 KB Output is correct
45 Correct 6 ms 2688 KB Output is correct
46 Correct 6 ms 2688 KB Output is correct
47 Correct 7 ms 2688 KB Output is correct
48 Correct 6 ms 2688 KB Output is correct
49 Correct 6 ms 2688 KB Output is correct
50 Correct 6 ms 2688 KB Output is correct
51 Correct 6 ms 2688 KB Output is correct
52 Correct 6 ms 2688 KB Output is correct
53 Correct 6 ms 2688 KB Output is correct
54 Correct 6 ms 2688 KB Output is correct
55 Correct 6 ms 2688 KB Output is correct
56 Correct 6 ms 2688 KB Output is correct
57 Correct 105 ms 9464 KB Output is correct
58 Correct 107 ms 9592 KB Output is correct
59 Correct 124 ms 9464 KB Output is correct
60 Correct 108 ms 9464 KB Output is correct
61 Correct 103 ms 9336 KB Output is correct
62 Correct 99 ms 9336 KB Output is correct
63 Correct 91 ms 9208 KB Output is correct
64 Correct 93 ms 9208 KB Output is correct
65 Correct 119 ms 9208 KB Output is correct
66 Correct 109 ms 9080 KB Output is correct
67 Correct 111 ms 9496 KB Output is correct
68 Correct 113 ms 9592 KB Output is correct
69 Correct 141 ms 9464 KB Output is correct
70 Correct 113 ms 9592 KB Output is correct
71 Correct 6 ms 2688 KB Output is correct
72 Correct 8 ms 2944 KB Output is correct
73 Correct 8 ms 2944 KB Output is correct
74 Correct 8 ms 2944 KB Output is correct
75 Correct 8 ms 2944 KB Output is correct
76 Correct 8 ms 2944 KB Output is correct
77 Correct 8 ms 2944 KB Output is correct
78 Correct 8 ms 2944 KB Output is correct
79 Correct 8 ms 2944 KB Output is correct
80 Correct 108 ms 9504 KB Output is correct
81 Correct 110 ms 9464 KB Output is correct
82 Correct 114 ms 9336 KB Output is correct
83 Correct 104 ms 9464 KB Output is correct
84 Correct 8 ms 2816 KB Output is correct
85 Correct 8 ms 2816 KB Output is correct
86 Correct 8 ms 2816 KB Output is correct
87 Correct 7 ms 2816 KB Output is correct
88 Correct 8 ms 2944 KB Output is correct
89 Correct 8 ms 2944 KB Output is correct
90 Correct 8 ms 2944 KB Output is correct
91 Correct 7 ms 2944 KB Output is correct
92 Correct 8 ms 2944 KB Output is correct
93 Correct 8 ms 2944 KB Output is correct
94 Correct 6 ms 2688 KB Output is correct
95 Correct 6 ms 2688 KB Output is correct
96 Correct 6 ms 2688 KB Output is correct
97 Correct 6 ms 2688 KB Output is correct
98 Correct 7 ms 2688 KB Output is correct
99 Correct 6 ms 2688 KB Output is correct
100 Correct 6 ms 2688 KB Output is correct
101 Correct 6 ms 2688 KB Output is correct
102 Correct 6 ms 2688 KB Output is correct
103 Correct 6 ms 2688 KB Output is correct
104 Correct 13 ms 3712 KB Output is correct
105 Correct 21 ms 5504 KB Output is correct
106 Correct 6 ms 2688 KB Output is correct
107 Correct 36 ms 6648 KB Output is correct
108 Correct 46 ms 8824 KB Output is correct
109 Correct 6 ms 2816 KB Output is correct
110 Correct 72 ms 10616 KB Output is correct
111 Correct 88 ms 10744 KB Output is correct
112 Correct 6 ms 2816 KB Output is correct
113 Correct 128 ms 16504 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 8820 KB Output is correct
2 Correct 38 ms 8836 KB Output is correct
3 Correct 37 ms 8820 KB Output is correct
4 Correct 38 ms 8820 KB Output is correct
5 Correct 37 ms 8820 KB Output is correct
6 Correct 39 ms 9584 KB Output is correct
7 Correct 39 ms 9076 KB Output is correct
8 Correct 37 ms 8700 KB Output is correct
9 Correct 37 ms 8696 KB Output is correct
10 Correct 42 ms 8944 KB Output is correct
11 Correct 6 ms 2688 KB Output is correct
12 Correct 28 ms 8812 KB Output is correct
13 Correct 26 ms 8948 KB Output is correct
14 Correct 27 ms 8820 KB Output is correct
15 Correct 28 ms 8812 KB Output is correct
16 Correct 29 ms 8684 KB Output is correct
17 Correct 32 ms 8048 KB Output is correct
18 Correct 27 ms 8948 KB Output is correct
19 Correct 28 ms 8680 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 7 ms 2944 KB Output is correct
23 Correct 29 ms 8684 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 15352 KB Output is correct
2 Correct 75 ms 15224 KB Output is correct
3 Correct 49 ms 10872 KB Output is correct
4 Correct 14 ms 4608 KB Output is correct
5 Correct 13 ms 3712 KB Output is correct
6 Correct 21 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 36 ms 6648 KB Output is correct
9 Correct 49 ms 8696 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 71 ms 10616 KB Output is correct
12 Correct 94 ms 11000 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Incorrect 6 ms 2816 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 15352 KB Output is correct
2 Correct 75 ms 15224 KB Output is correct
3 Correct 49 ms 10872 KB Output is correct
4 Correct 14 ms 4608 KB Output is correct
5 Correct 13 ms 3712 KB Output is correct
6 Correct 21 ms 5504 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 36 ms 6648 KB Output is correct
9 Correct 49 ms 8696 KB Output is correct
10 Correct 6 ms 2816 KB Output is correct
11 Correct 71 ms 10616 KB Output is correct
12 Correct 94 ms 11000 KB Output is correct
13 Correct 6 ms 2816 KB Output is correct
14 Correct 6 ms 2688 KB Output is correct
15 Correct 6 ms 2688 KB Output is correct
16 Correct 6 ms 2688 KB Output is correct
17 Correct 6 ms 2688 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 6 ms 2688 KB Output is correct
23 Correct 6 ms 2816 KB Output is correct
24 Correct 6 ms 2688 KB Output is correct
25 Correct 6 ms 2688 KB Output is correct
26 Correct 6 ms 2688 KB Output is correct
27 Correct 6 ms 2688 KB Output is correct
28 Correct 6 ms 2688 KB Output is correct
29 Correct 6 ms 2688 KB Output is correct
30 Correct 6 ms 2688 KB Output is correct
31 Correct 6 ms 2688 KB Output is correct
32 Correct 6 ms 2688 KB Output is correct
33 Correct 6 ms 2688 KB Output is correct
34 Correct 7 ms 2688 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2688 KB Output is correct
37 Correct 6 ms 2688 KB Output is correct
38 Correct 6 ms 2688 KB Output is correct
39 Correct 75 ms 15480 KB Output is correct
40 Correct 73 ms 15224 KB Output is correct
41 Correct 50 ms 11000 KB Output is correct
42 Correct 15 ms 4568 KB Output is correct
43 Correct 6 ms 2688 KB Output is correct
44 Correct 6 ms 2688 KB Output is correct
45 Correct 6 ms 2688 KB Output is correct
46 Correct 6 ms 2688 KB Output is correct
47 Correct 7 ms 2688 KB Output is correct
48 Correct 6 ms 2688 KB Output is correct
49 Correct 6 ms 2688 KB Output is correct
50 Correct 6 ms 2688 KB Output is correct
51 Correct 6 ms 2688 KB Output is correct
52 Correct 6 ms 2688 KB Output is correct
53 Correct 6 ms 2688 KB Output is correct
54 Correct 6 ms 2688 KB Output is correct
55 Correct 6 ms 2688 KB Output is correct
56 Correct 6 ms 2688 KB Output is correct
57 Correct 105 ms 9464 KB Output is correct
58 Correct 107 ms 9592 KB Output is correct
59 Correct 124 ms 9464 KB Output is correct
60 Correct 108 ms 9464 KB Output is correct
61 Correct 103 ms 9336 KB Output is correct
62 Correct 99 ms 9336 KB Output is correct
63 Correct 91 ms 9208 KB Output is correct
64 Correct 93 ms 9208 KB Output is correct
65 Correct 119 ms 9208 KB Output is correct
66 Correct 109 ms 9080 KB Output is correct
67 Correct 111 ms 9496 KB Output is correct
68 Correct 113 ms 9592 KB Output is correct
69 Correct 141 ms 9464 KB Output is correct
70 Correct 113 ms 9592 KB Output is correct
71 Correct 6 ms 2688 KB Output is correct
72 Correct 8 ms 2944 KB Output is correct
73 Correct 8 ms 2944 KB Output is correct
74 Correct 8 ms 2944 KB Output is correct
75 Correct 8 ms 2944 KB Output is correct
76 Correct 8 ms 2944 KB Output is correct
77 Correct 8 ms 2944 KB Output is correct
78 Correct 8 ms 2944 KB Output is correct
79 Correct 8 ms 2944 KB Output is correct
80 Correct 108 ms 9504 KB Output is correct
81 Correct 110 ms 9464 KB Output is correct
82 Correct 114 ms 9336 KB Output is correct
83 Correct 104 ms 9464 KB Output is correct
84 Correct 8 ms 2816 KB Output is correct
85 Correct 8 ms 2816 KB Output is correct
86 Correct 8 ms 2816 KB Output is correct
87 Correct 7 ms 2816 KB Output is correct
88 Correct 8 ms 2944 KB Output is correct
89 Correct 8 ms 2944 KB Output is correct
90 Correct 8 ms 2944 KB Output is correct
91 Correct 7 ms 2944 KB Output is correct
92 Correct 8 ms 2944 KB Output is correct
93 Correct 8 ms 2944 KB Output is correct
94 Correct 6 ms 2688 KB Output is correct
95 Correct 6 ms 2688 KB Output is correct
96 Correct 6 ms 2688 KB Output is correct
97 Correct 6 ms 2688 KB Output is correct
98 Correct 7 ms 2688 KB Output is correct
99 Correct 6 ms 2688 KB Output is correct
100 Correct 6 ms 2688 KB Output is correct
101 Correct 6 ms 2688 KB Output is correct
102 Correct 6 ms 2688 KB Output is correct
103 Correct 6 ms 2688 KB Output is correct
104 Correct 13 ms 3712 KB Output is correct
105 Correct 21 ms 5504 KB Output is correct
106 Correct 6 ms 2688 KB Output is correct
107 Correct 36 ms 6648 KB Output is correct
108 Correct 46 ms 8824 KB Output is correct
109 Correct 6 ms 2816 KB Output is correct
110 Correct 72 ms 10616 KB Output is correct
111 Correct 88 ms 10744 KB Output is correct
112 Correct 6 ms 2816 KB Output is correct
113 Correct 128 ms 16504 KB Output is correct
114 Correct 37 ms 8820 KB Output is correct
115 Correct 38 ms 8836 KB Output is correct
116 Correct 37 ms 8820 KB Output is correct
117 Correct 38 ms 8820 KB Output is correct
118 Correct 37 ms 8820 KB Output is correct
119 Correct 39 ms 9584 KB Output is correct
120 Correct 39 ms 9076 KB Output is correct
121 Correct 37 ms 8700 KB Output is correct
122 Correct 37 ms 8696 KB Output is correct
123 Correct 42 ms 8944 KB Output is correct
124 Correct 6 ms 2688 KB Output is correct
125 Correct 28 ms 8812 KB Output is correct
126 Correct 26 ms 8948 KB Output is correct
127 Correct 27 ms 8820 KB Output is correct
128 Correct 28 ms 8812 KB Output is correct
129 Correct 29 ms 8684 KB Output is correct
130 Correct 32 ms 8048 KB Output is correct
131 Correct 27 ms 8948 KB Output is correct
132 Correct 28 ms 8680 KB Output is correct
133 Correct 6 ms 2688 KB Output is correct
134 Correct 6 ms 2688 KB Output is correct
135 Correct 7 ms 2944 KB Output is correct
136 Correct 29 ms 8684 KB Output is correct
137 Incorrect 6 ms 2816 KB Output isn't correct
138 Halted 0 ms 0 KB -