oj.uz

Submission #624871

# Submission time Handle Problem Language Result Execution time Memory
624871 2022-08-08T23:21:09 Z Joshua_Andersson Art Collections (BOI22_art) C++17
100 / 100
 1475 ms 728 KB 
#undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/stdc++.h>
using namespace std;

#define enablell 0

typedef long long ll;
const int mod = 1e9 + 7;
#if enablell
#define int ll
#define inf int(1e18)
#define float double
#else
const int inf = int(2e9);
#endif
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef pair<int, int> p2;
typedef vector<p2> vp2;
typedef vector<vp2> vvp2;
typedef vector<vvp2> vvvp2;
typedef tuple<int, int, int> p3;
typedef vector<p3> vp3;
typedef vector<vp3> vvp3;
typedef vector<vvp3> vvvp3;
typedef tuple<int, int, int, int> p4;
typedef vector<p4> vp4;

#define _LOCAL _MSC_VER > 0
#if _LOCAL
#define gc() getchar()
#define popcount(x) __popcnt(x)
#define leading_zeros(x) _lzcnt_u32(x)
#define assert(x) debassert(x)
#else
#define popcount(x) __builtin__popcount(x)
#define leading_zeros(x) __builtin_clz(x)
#define gc() getchar_unlocked()
#if 0
#include <bits/extc++.h>
using namespace __gnu_pbds;
struct chash { // large odd number for C
    const uint64_t C = ll(4e18 * acos(0)) | 71;
    ll operator()(ll x) const { return x; }
};
//typedef __gnu_pbds::gp_hash_table<int, null_type, chash> h;
#endif

#endif

#if 1
inline void read(int& v) { v = 0; int sign = 1; char c = gc(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = gc()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } v *= sign; }
//inline void read(int& v) { char c; while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } }
inline void read(string& s) { char c; while ((c = gc()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } }
#else
template <typename T> inline void read(T& a) { cin >> a; }
template <typename T> inline void read(T& a, T& b) { cin >> a >> b; }
template <typename T> inline void read(T& a, T& b, T& c) { cin >> a >> b >> c; }
#endif
template <typename T> inline void write(T& a) { cout << (a) << "\n"; }
#define quit cout << endl; _Exit(0);
#define dread(type, a) type a; read(a)
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#ifdef _DEBUG
#define noop cout << "";
#define deb __debugbreak();
#define debassert(expr) if (!(expr)) deb;
#define debif(expr) if(expr) deb;
#else
#define noop ;
#define deb ;
#define debassert(expr) ;
#define debif(expr) ;
#endif

#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (int i = high-1; i >= 0; i--)
#define perr(i, low, high) for (int i = high-1; i >= low; i--)

#define all(a) a.begin(),a.end()
#define revall(a) a.rbegin(),a.rend()
#define setcontains(set, x) (set.find(x) != set.end())
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)
#define sz(container) ((int)container.size())
#define mp(a,b) (make_pair(a,b))
#define first(a) (*begin(a))
#define indexpair(p, i) ((i==0)?p.first:p.second)
#define chmax(a,b) ((a)=max((a),b))
#define chmin(a,b) ((a)=min((a),b))

#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))

#if 1
auto Start = chrono::high_resolution_clock::now();
#define elapsedmillis() (chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - Start).count())
#define rununtil(time) if (elapsedmillis() >= time) break;
random_device rd;
mt19937 rng(rd());
#endif

inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
template <typename T, typename U> inline void operator+=(pair<T, U>& l, const pair<T, U>& r) { l = { l.first + r.first,l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator+(const pair<T, U>& l, const pair<T, U>& r) { return { l.first + r.first, l.second + r.second }; }
template <typename T, typename U> inline pair<T, U> operator-(const pair<T, U>& l, const pair<T, U>& r) { return { l.first - r.first, l.second - r.second }; }
template <typename T, typename U> inline pair<T, U> operator*(const pair<T, U>& l, const int m) { return { l.first * m, l.second * m }; }
template <typename Out> inline void split(const string& s, char delim, Out result) { istringstream iss(s); string item; while (getline(iss, item, delim)) { *result++ = item; } }
inline vector<string> split(const string& s, char delim) { vector<string> elems; split(s, delim, back_inserter(elems)); return elems; }

#if _LOCAL
int q = 0;
vi solution;
int n;
int publish(vector<int> R) {
    q++;
    printf("publish({");
    for (int i = 0; i < int(R.size()); ++i) {
        if (i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);


    if (int(R.size()) != n)
        write("Invalid published ranking 1!");

    set<int> chosen;
    for (auto& x : R) {
        if (x < 1 || x > n || chosen.count(x))
            write("Invalid published ranking 2!");
        chosen.insert(x);
    }
    vector<int> positions(n + 1);
    for (int i = 0; i < n; ++i)
        positions[R[i]] = i;

    int complaints = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (positions[solution[i]] > positions[solution[j]])
                ++complaints;
        }
    }

    return complaints;
}
#else
#include "art.h"
#endif

void solve(int n)
{
    vi nums(n);
    rep(i, n) nums[i] = i + 1;

    int start = publish(nums);
    int last = start;
    int newValue;

    vi ans(n);
    rep(i, n-1)
    {
        rotate(begin(nums), begin(nums)+1,end(nums));
        newValue = publish(nums);
        ans[i] = ((newValue - last) + n) / 2;
        last = newValue;
    }
    ans[n - 1] = ((start - newValue) + n) / 2;
    vi ans2(n);
    rep(i, n) ans2[ans[i]] = i + 1;
    reverse(all(ans2));
    //rep(i, n) cout << ans2[i] << " ";
    answer(ans2);
}

#if _LOCAL
int32_t main()
{
    fast();

#if 0
    //ifstream cin("C:\\Users\\Matis\\source\\repos\\Comp prog\\x64\\Debug\\in.txt");
    //ifstream cin("C:\\Users\\Matis\\desktop\\po-two\\swedish-olympiad-2014\\");
#endif

    read(n);
    solution.resize(n);
    rep(i, n) read(solution[i]);

    solve(n);
    cout << q;

    quit;
}
#endif

Compilation message

art.cpp: In function 'void solve(int)':
art.cpp:190:26: warning: 'newValue' may be used uninitialized in this function [-Wmaybe-uninitialized]
  190 |     ans[n - 1] = ((start - newValue) + n) / 2;
      |                   ~~~~~~~^~~~~~~~~~~
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 10 ms 308 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 7 ms 208 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
31 Correct 8 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 10 ms 208 KB Output is correct
46 Correct 10 ms 208 KB Output is correct
47 Correct 8 ms 208 KB Output is correct
48 Correct 8 ms 208 KB Output is correct
49 Correct 7 ms 208 KB Output is correct
50 Correct 7 ms 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 23 ms 296 KB Output is correct
53 Correct 21 ms 208 KB Output is correct
54 Correct 18 ms 208 KB Output is correct
55 Correct 21 ms 208 KB Output is correct
56 Correct 18 ms 208 KB Output is correct
57 Correct 19 ms 208 KB Output is correct
58 Correct 0 ms 208 KB Output is correct
59 Correct 0 ms 208 KB Output is correct
60 Correct 0 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 1 ms 208 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 10 ms 308 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 7 ms 208 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
31 Correct 8 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 10 ms 208 KB Output is correct
46 Correct 10 ms 208 KB Output is correct
47 Correct 8 ms 208 KB Output is correct
48 Correct 8 ms 208 KB Output is correct
49 Correct 7 ms 208 KB Output is correct
50 Correct 7 ms 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 23 ms 296 KB Output is correct
53 Correct 21 ms 208 KB Output is correct
54 Correct 18 ms 208 KB Output is correct
55 Correct 21 ms 208 KB Output is correct
56 Correct 18 ms 208 KB Output is correct
57 Correct 19 ms 208 KB Output is correct
58 Correct 0 ms 208 KB Output is correct
59 Correct 0 ms 208 KB Output is correct
60 Correct 0 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 1 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 10 ms 312 KB Output is correct
71 Correct 9 ms 208 KB Output is correct
72 Correct 8 ms 208 KB Output is correct
73 Correct 8 ms 208 KB Output is correct
74 Correct 8 ms 208 KB Output is correct
75 Correct 7 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 21 ms 208 KB Output is correct
78 Correct 19 ms 292 KB Output is correct
79 Correct 23 ms 300 KB Output is correct
80 Correct 23 ms 292 KB Output is correct
81 Correct 24 ms 296 KB Output is correct
82 Correct 19 ms 292 KB Output is correct
83 Correct 356 ms 424 KB Output is correct
84 Correct 344 ms 428 KB Output is correct
85 Correct 379 ms 484 KB Output is correct
86 Correct 342 ms 476 KB Output is correct
87 Correct 3 ms 208 KB Output is correct
88 Correct 342 ms 464 KB Output is correct
89 Correct 373 ms 392 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 0 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 236 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 10 ms 308 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 7 ms 208 KB Output is correct
30 Correct 10 ms 208 KB Output is correct
31 Correct 8 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 2 ms 208 KB Output is correct
42 Correct 1 ms 208 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 10 ms 208 KB Output is correct
46 Correct 10 ms 208 KB Output is correct
47 Correct 8 ms 208 KB Output is correct
48 Correct 8 ms 208 KB Output is correct
49 Correct 7 ms 208 KB Output is correct
50 Correct 7 ms 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 23 ms 296 KB Output is correct
53 Correct 21 ms 208 KB Output is correct
54 Correct 18 ms 208 KB Output is correct
55 Correct 21 ms 208 KB Output is correct
56 Correct 18 ms 208 KB Output is correct
57 Correct 19 ms 208 KB Output is correct
58 Correct 0 ms 208 KB Output is correct
59 Correct 0 ms 208 KB Output is correct
60 Correct 0 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 1 ms 208 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 10 ms 312 KB Output is correct
71 Correct 9 ms 208 KB Output is correct
72 Correct 8 ms 208 KB Output is correct
73 Correct 8 ms 208 KB Output is correct
74 Correct 8 ms 208 KB Output is correct
75 Correct 7 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 21 ms 208 KB Output is correct
78 Correct 19 ms 292 KB Output is correct
79 Correct 23 ms 300 KB Output is correct
80 Correct 23 ms 292 KB Output is correct
81 Correct 24 ms 296 KB Output is correct
82 Correct 19 ms 292 KB Output is correct
83 Correct 356 ms 424 KB Output is correct
84 Correct 344 ms 428 KB Output is correct
85 Correct 379 ms 484 KB Output is correct
86 Correct 342 ms 476 KB Output is correct
87 Correct 3 ms 208 KB Output is correct
88 Correct 342 ms 464 KB Output is correct
89 Correct 373 ms 392 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct
92 Correct 0 ms 208 KB Output is correct
93 Correct 0 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 0 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 208 KB Output is correct
100 Correct 1 ms 208 KB Output is correct
101 Correct 11 ms 208 KB Output is correct
102 Correct 7 ms 208 KB Output is correct
103 Correct 7 ms 316 KB Output is correct
104 Correct 7 ms 304 KB Output is correct
105 Correct 7 ms 292 KB Output is correct
106 Correct 10 ms 208 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 27 ms 296 KB Output is correct
109 Correct 19 ms 296 KB Output is correct
110 Correct 19 ms 300 KB Output is correct
111 Correct 23 ms 308 KB Output is correct
112 Correct 18 ms 308 KB Output is correct
113 Correct 19 ms 296 KB Output is correct
114 Correct 338 ms 528 KB Output is correct
115 Correct 351 ms 452 KB Output is correct
116 Correct 349 ms 560 KB Output is correct
117 Correct 370 ms 496 KB Output is correct
118 Correct 0 ms 208 KB Output is correct
119 Correct 359 ms 468 KB Output is correct
120 Correct 327 ms 468 KB Output is correct
121 Correct 1396 ms 620 KB Output is correct
122 Correct 1434 ms 640 KB Output is correct
123 Correct 1373 ms 612 KB Output is correct
124 Correct 1475 ms 676 KB Output is correct
125 Correct 1452 ms 728 KB Output is correct
126 Correct 1296 ms 548 KB Output is correct
127 Correct 0 ms 208 KB Output is correct
128 Correct 0 ms 208 KB Output is correct
129 Correct 0 ms 208 KB Output is correct
130 Correct 1 ms 208 KB Output is correct
131 Correct 1 ms 208 KB Output is correct
132 Correct 1 ms 208 KB Output is correct