oj.uz

Submission #1064122

# Submission time Handle Problem Language Result Execution time Memory
1064122 2024-08-18T09:26:09 Z 8e7 Tricolor Lights (JOI24_tricolor) C++17
30 / 100
 66 ms 7112 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);




int to_int(char c) {
    if (c == 'R') return 0;
    else if (c == 'G') return 1;
    else return 2;
}

char to_char(int i) {
    const string S = "RGB";
    return S[i];
}

int base_one(int prv, int res) {
    if ((prv+1)%3 != res) return (prv+1)%3;
    else return (prv+2)%3;
}

int diff(int a, int b) {
    //returns a number from 0~2 different from both a and b
    if ((a+1)%3 == b) return (a+2)%3;
    else return (a+1)%3;
}

int fib[30];
const int maxfib = 28;
}
void add_bit(std::vector<int> &ret, std::vector<int> &v, int bit) {
    //add semantic bit, could be 0/1/2
    int ind = ret.size();
    if (ind >= v.size()) return;
    for (int i = 0;i < bit*2;i++) {
        ret.push_back(base_one(ret.back(), v[ind])); 
        ind++;
        if (ind >= v.size()) return;
    }
    if (ret.back() != v[ind]) {
        ret.push_back(ret.back()); //base 0
        ind++;
    } else {
        if (ind+1 >= v.size()) {
            ret.push_back(base_one(ret.back(), v[ind]));
            return;
        }
        ret.push_back(base_one(ret.back(), v[ind+1])); 
        ret.push_back(ret.back());
        ind+=2; 
    }
}

pair<string, int> anna(int N, string S) {
    fib[0] = fib[1] = 1;
    for (int i = 2;i < 29;i++) fib[i] = fib[i-1] + fib[i-2]; 
    

    vector<int> v(N, 0), ret;
    for (int i = 0;i < N;i++) v[i] = to_int(S[i]);
    ret.push_back((v[0]+1)%3);
    int maxlen = 0;
    while (ret.size() < N) {
        int pos = ret.size();
        //try to encode pos      
        vector<int> bi;
        for (int i = maxfib;i > 0;i--) {
            if (pos >= fib[i]) bi.push_back(1), pos -= fib[i];
            else bi.push_back(0);
        }
        reverse(bi.begin(), bi.end());
        while (bi.size() && bi.back() == 0) bi.pop_back();
        int len = 0;
        for (int b:bi) {
            len += (b+1)*2;
            add_bit(ret, v, b);
        } 
        maxlen = max(maxlen, len); 
        add_bit(ret, v, 2); //add separator
    }
    int L = min(N, maxlen*2+6);
    string ans;
    for (int i = 0;i < N;i++) {
        ans.push_back(to_char(ret[i]));
    }
    debug(ans, S);
    return make_pair(ans, L);
}

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

namespace {
#ifdef zisk
void debug(){cout << endl;}
template<class T, class ... U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#else
#define debug(...) 0
#define pary(...) 0
#endif
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);


int N, L;
int to_int(char c) {
    if (c == 'R') return 0;
    else if (c == 'G') return 1;
    else return 2;
}

char to_char(int i) {
    const string S = "RGB";
    return S[i];
}

int base_one(int prv, int res) {
    if ((prv+1)%3 != res) return (prv+1)%3;
    else return (prv+2)%3;
}
const int maxfib = 28;
int fib[30];

}
void init(int N, int l) {
    ::N = N;
    ::L = l;
    debug("L", l);

    fib[0] = fib[1] = 1;
    for (int i = 2;i < 29;i++) fib[i] = fib[i-1] + fib[i-2]; 
}

int bruno(string s) {
    if (N == L) return 1;
    int len = s.size();
    vector<int> v;
    for (int i = 1;i < len;i++) {
        if (s[i] == s[i-1]) v.push_back(0);
        else v.push_back(1);
    }
    debug(s);
    pary(v.begin(), v.end());
    vector<int> bits, pref;
    int count = 0;
    for (int i = 0;i < v.size();i++) {
        if (v[i] == 0) {
            bits.push_back(count / 2);
            pref.push_back(i - count);
            count = 0;
        } else {
            count += 1;
        }
    }
    if (count >= 4) {
        bits.push_back(2);
        pref.push_back(v.size() - count);
    }
    pary(bits.begin(), bits.end());
    pary(pref.begin(), pref.end());
    int ind = 1, num = 0;
    for (int i = 0;i < bits.size();i++) {
        if (bits[i] == 2) {
            for (int j = i+1;j < bits.size();j++) {
                if (bits[j] == 2) break;
                num += bits[j] * fib[ind];
                ind += 1;
            }
            debug(num);
            num -= pref[i+1];
            break;
        }
    }
    debug("Answer", num);
    return num;
}

Compilation message

Anna.cpp: In function 'void add_bit(std::vector<int>&, std::vector<int>&, int)':
Anna.cpp:54:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     if (ind >= v.size()) return;
      |         ~~~~^~~~~~~~~~~
Anna.cpp:58:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         if (ind >= v.size()) return;
      |             ~~~~^~~~~~~~~~~
Anna.cpp:64:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         if (ind+1 >= v.size()) {
      |             ~~~~~~^~~~~~~~~~~
Anna.cpp: In function 'std::pair<std::__cxx11::basic_string<char>, int> anna(int, std::string)':
Anna.cpp:83:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   83 |     while (ret.size() < N) {
      |            ~~~~~~~~~~~^~~
Anna.cpp:13:20: warning: statement has no effect [-Wunused-value]
   13 | #define debug(...) 0
      |                    ^
Anna.cpp:106:5: note: in expansion of macro 'debug'
  106 |     debug(ans, S);
      |     ^~~~~
Anna.cpp: At global scope:
Anna.cpp:42:5: warning: 'int {anonymous}::diff(int, int)' defined but not used [-Wunused-function]
   42 | int diff(int a, int b) {
      |     ^~~~

Bruno.cpp: In function 'void init(int, int)':
Bruno.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Bruno.cpp:48:5: note: in expansion of macro 'debug'
   48 |     debug("L", l);
      |     ^~~~~
Bruno.cpp: In function 'int bruno(std::string)':
Bruno.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Bruno.cpp:62:5: note: in expansion of macro 'debug'
   62 |     debug(s);
      |     ^~~~~
Bruno.cpp:15:19: warning: statement has no effect [-Wunused-value]
   15 | #define pary(...) 0
      |                   ^
Bruno.cpp:63:5: note: in expansion of macro 'pary'
   63 |     pary(v.begin(), v.end());
      |     ^~~~
Bruno.cpp:66:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0;i < v.size();i++) {
      |                    ~~^~~~~~~~~~
Bruno.cpp:15:19: warning: statement has no effect [-Wunused-value]
   15 | #define pary(...) 0
      |                   ^
Bruno.cpp:79:5: note: in expansion of macro 'pary'
   79 |     pary(bits.begin(), bits.end());
      |     ^~~~
Bruno.cpp:15:19: warning: statement has no effect [-Wunused-value]
   15 | #define pary(...) 0
      |                   ^
Bruno.cpp:80:5: note: in expansion of macro 'pary'
   80 |     pary(pref.begin(), pref.end());
      |     ^~~~
Bruno.cpp:82:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for (int i = 0;i < bits.size();i++) {
      |                    ~~^~~~~~~~~~~~~
Bruno.cpp:84:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |             for (int j = i+1;j < bits.size();j++) {
      |                              ~~^~~~~~~~~~~~~
Bruno.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Bruno.cpp:89:13: note: in expansion of macro 'debug'
   89 |             debug(num);
      |             ^~~~~
Bruno.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Bruno.cpp:94:5: note: in expansion of macro 'debug'
   94 |     debug("Answer", num);
      |     ^~~~~
Bruno.cpp: At global scope:
Bruno.cpp:37:5: warning: 'int {anonymous}::base_one(int, int)' defined but not used [-Wunused-function]
   37 | int base_one(int prv, int res) {
      |     ^~~~~~~~
Bruno.cpp:32:6: warning: 'char {anonymous}::to_char(int)' defined but not used [-Wunused-function]
   32 | char to_char(int i) {
      |      ^~~~~~~
Bruno.cpp:26:5: warning: 'int {anonymous}::to_int(char)' defined but not used [-Wunused-function]
   26 | int to_int(char c) {
      |     ^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1344 KB Output is correct
2 Correct 24 ms 1348 KB Output is correct
3 Correct 24 ms 1344 KB Output is correct
4 Correct 26 ms 1292 KB Output is correct
5 Correct 44 ms 1344 KB Output is correct
6 Correct 32 ms 1392 KB Output is correct
7 Correct 33 ms 1412 KB Output is correct
8 Correct 32 ms 1324 KB Output is correct
9 Correct 32 ms 1336 KB Output is correct
10 Correct 25 ms 1288 KB Output is correct
11 Correct 25 ms 1332 KB Output is correct
12 Correct 25 ms 1292 KB Output is correct
13 Correct 25 ms 1392 KB Output is correct
14 Correct 26 ms 1292 KB Output is correct
15 Correct 26 ms 1332 KB Output is correct
16 Correct 37 ms 1288 KB Output is correct
17 Correct 31 ms 1352 KB Output is correct
18 Correct 27 ms 1356 KB Output is correct
19 Correct 29 ms 1284 KB Output is correct
20 Correct 39 ms 1308 KB Output is correct
21 Correct 26 ms 1348 KB Output is correct
22 Correct 25 ms 1404 KB Output is correct
23 Correct 41 ms 1312 KB Output is correct
24 Correct 27 ms 1324 KB Output is correct
25 Correct 33 ms 1320 KB Output is correct
26 Correct 36 ms 1380 KB Output is correct
27 Correct 33 ms 1300 KB Output is correct
28 Correct 32 ms 1340 KB Output is correct
29 Correct 32 ms 1328 KB Output is correct
30 Correct 37 ms 1392 KB Output is correct
31 Correct 33 ms 1292 KB Output is correct
32 Correct 32 ms 1288 KB Output is correct
33 Correct 32 ms 1384 KB Output is correct
34 Correct 25 ms 1360 KB Output is correct
35 Correct 25 ms 1396 KB Output is correct
36 Correct 52 ms 1384 KB Output is correct
37 Correct 31 ms 1288 KB Output is correct
38 Correct 32 ms 1380 KB Output is correct
39 Correct 39 ms 1292 KB Output is correct
40 Correct 36 ms 1316 KB Output is correct
41 Correct 33 ms 1596 KB Output is correct
42 Correct 51 ms 1348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1344 KB Output is correct
2 Correct 24 ms 1348 KB Output is correct
3 Correct 24 ms 1344 KB Output is correct
4 Correct 26 ms 1292 KB Output is correct
5 Correct 44 ms 1344 KB Output is correct
6 Correct 32 ms 1392 KB Output is correct
7 Correct 33 ms 1412 KB Output is correct
8 Correct 32 ms 1324 KB Output is correct
9 Correct 32 ms 1336 KB Output is correct
10 Correct 25 ms 1288 KB Output is correct
11 Correct 25 ms 1332 KB Output is correct
12 Correct 25 ms 1292 KB Output is correct
13 Correct 25 ms 1392 KB Output is correct
14 Correct 26 ms 1292 KB Output is correct
15 Correct 26 ms 1332 KB Output is correct
16 Correct 37 ms 1288 KB Output is correct
17 Correct 31 ms 1352 KB Output is correct
18 Correct 27 ms 1356 KB Output is correct
19 Correct 29 ms 1284 KB Output is correct
20 Correct 39 ms 1308 KB Output is correct
21 Correct 26 ms 1348 KB Output is correct
22 Correct 25 ms 1404 KB Output is correct
23 Correct 41 ms 1312 KB Output is correct
24 Correct 27 ms 1324 KB Output is correct
25 Correct 33 ms 1320 KB Output is correct
26 Correct 36 ms 1380 KB Output is correct
27 Correct 33 ms 1300 KB Output is correct
28 Correct 32 ms 1340 KB Output is correct
29 Correct 32 ms 1328 KB Output is correct
30 Correct 37 ms 1392 KB Output is correct
31 Correct 33 ms 1292 KB Output is correct
32 Correct 32 ms 1288 KB Output is correct
33 Correct 32 ms 1384 KB Output is correct
34 Correct 25 ms 1360 KB Output is correct
35 Correct 25 ms 1396 KB Output is correct
36 Correct 52 ms 1384 KB Output is correct
37 Correct 31 ms 1288 KB Output is correct
38 Correct 32 ms 1380 KB Output is correct
39 Correct 39 ms 1292 KB Output is correct
40 Correct 36 ms 1316 KB Output is correct
41 Correct 33 ms 1596 KB Output is correct
42 Correct 51 ms 1348 KB Output is correct
43 Correct 34 ms 1380 KB Output is correct
44 Correct 34 ms 1384 KB Output is correct
45 Correct 53 ms 1284 KB Output is correct
46 Correct 54 ms 1288 KB Output is correct
47 Correct 34 ms 1324 KB Output is correct
48 Correct 37 ms 1340 KB Output is correct
49 Correct 35 ms 1324 KB Output is correct
50 Correct 35 ms 1392 KB Output is correct
51 Correct 35 ms 1328 KB Output is correct
52 Correct 33 ms 1380 KB Output is correct
53 Correct 55 ms 1324 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1344 KB Output is correct
2 Correct 24 ms 1348 KB Output is correct
3 Correct 24 ms 1344 KB Output is correct
4 Correct 26 ms 1292 KB Output is correct
5 Correct 44 ms 1344 KB Output is correct
6 Correct 32 ms 1392 KB Output is correct
7 Correct 33 ms 1412 KB Output is correct
8 Correct 32 ms 1324 KB Output is correct
9 Correct 32 ms 1336 KB Output is correct
10 Correct 25 ms 1288 KB Output is correct
11 Correct 25 ms 1332 KB Output is correct
12 Correct 25 ms 1292 KB Output is correct
13 Correct 25 ms 1392 KB Output is correct
14 Correct 26 ms 1292 KB Output is correct
15 Correct 26 ms 1332 KB Output is correct
16 Correct 37 ms 1288 KB Output is correct
17 Correct 31 ms 1352 KB Output is correct
18 Correct 27 ms 1356 KB Output is correct
19 Correct 29 ms 1284 KB Output is correct
20 Correct 39 ms 1308 KB Output is correct
21 Correct 26 ms 1348 KB Output is correct
22 Correct 25 ms 1404 KB Output is correct
23 Correct 41 ms 1312 KB Output is correct
24 Correct 27 ms 1324 KB Output is correct
25 Correct 33 ms 1320 KB Output is correct
26 Correct 36 ms 1380 KB Output is correct
27 Correct 33 ms 1300 KB Output is correct
28 Correct 32 ms 1340 KB Output is correct
29 Correct 32 ms 1328 KB Output is correct
30 Correct 37 ms 1392 KB Output is correct
31 Correct 33 ms 1292 KB Output is correct
32 Correct 32 ms 1288 KB Output is correct
33 Correct 32 ms 1384 KB Output is correct
34 Correct 25 ms 1360 KB Output is correct
35 Correct 25 ms 1396 KB Output is correct
36 Correct 52 ms 1384 KB Output is correct
37 Correct 31 ms 1288 KB Output is correct
38 Correct 32 ms 1380 KB Output is correct
39 Correct 39 ms 1292 KB Output is correct
40 Correct 36 ms 1316 KB Output is correct
41 Correct 33 ms 1596 KB Output is correct
42 Correct 51 ms 1348 KB Output is correct
43 Correct 34 ms 1380 KB Output is correct
44 Correct 34 ms 1384 KB Output is correct
45 Correct 53 ms 1284 KB Output is correct
46 Correct 54 ms 1288 KB Output is correct
47 Correct 34 ms 1324 KB Output is correct
48 Correct 37 ms 1340 KB Output is correct
49 Correct 35 ms 1324 KB Output is correct
50 Correct 35 ms 1392 KB Output is correct
51 Correct 35 ms 1328 KB Output is correct
52 Correct 33 ms 1380 KB Output is correct
53 Correct 55 ms 1324 KB Output is correct
54 Correct 36 ms 1368 KB Output is correct
55 Correct 37 ms 1356 KB Output is correct
56 Correct 40 ms 1344 KB Output is correct
57 Correct 37 ms 1376 KB Output is correct
58 Correct 34 ms 1336 KB Output is correct
59 Correct 42 ms 1328 KB Output is correct
60 Correct 35 ms 1328 KB Output is correct
61 Correct 40 ms 1324 KB Output is correct
62 Correct 35 ms 1392 KB Output is correct
63 Correct 35 ms 1292 KB Output is correct
64 Correct 35 ms 1344 KB Output is correct
65 Correct 35 ms 1352 KB Output is correct
66 Correct 66 ms 1384 KB Output is correct
67 Correct 36 ms 1332 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1344 KB Output is correct
2 Correct 24 ms 1348 KB Output is correct
3 Correct 24 ms 1344 KB Output is correct
4 Correct 26 ms 1292 KB Output is correct
5 Correct 44 ms 1344 KB Output is correct
6 Correct 32 ms 1392 KB Output is correct
7 Correct 33 ms 1412 KB Output is correct
8 Correct 32 ms 1324 KB Output is correct
9 Correct 32 ms 1336 KB Output is correct
10 Correct 25 ms 1288 KB Output is correct
11 Correct 25 ms 1332 KB Output is correct
12 Correct 25 ms 1292 KB Output is correct
13 Correct 25 ms 1392 KB Output is correct
14 Correct 26 ms 1292 KB Output is correct
15 Correct 26 ms 1332 KB Output is correct
16 Correct 37 ms 1288 KB Output is correct
17 Correct 31 ms 1352 KB Output is correct
18 Correct 27 ms 1356 KB Output is correct
19 Correct 29 ms 1284 KB Output is correct
20 Correct 39 ms 1308 KB Output is correct
21 Correct 26 ms 1348 KB Output is correct
22 Correct 25 ms 1404 KB Output is correct
23 Correct 41 ms 1312 KB Output is correct
24 Correct 27 ms 1324 KB Output is correct
25 Correct 33 ms 1320 KB Output is correct
26 Correct 36 ms 1380 KB Output is correct
27 Correct 33 ms 1300 KB Output is correct
28 Correct 32 ms 1340 KB Output is correct
29 Correct 32 ms 1328 KB Output is correct
30 Correct 37 ms 1392 KB Output is correct
31 Correct 33 ms 1292 KB Output is correct
32 Correct 32 ms 1288 KB Output is correct
33 Correct 32 ms 1384 KB Output is correct
34 Correct 25 ms 1360 KB Output is correct
35 Correct 25 ms 1396 KB Output is correct
36 Correct 52 ms 1384 KB Output is correct
37 Correct 31 ms 1288 KB Output is correct
38 Correct 32 ms 1380 KB Output is correct
39 Correct 39 ms 1292 KB Output is correct
40 Correct 36 ms 1316 KB Output is correct
41 Correct 33 ms 1596 KB Output is correct
42 Correct 51 ms 1348 KB Output is correct
43 Correct 34 ms 1380 KB Output is correct
44 Correct 34 ms 1384 KB Output is correct
45 Correct 53 ms 1284 KB Output is correct
46 Correct 54 ms 1288 KB Output is correct
47 Correct 34 ms 1324 KB Output is correct
48 Correct 37 ms 1340 KB Output is correct
49 Correct 35 ms 1324 KB Output is correct
50 Correct 35 ms 1392 KB Output is correct
51 Correct 35 ms 1328 KB Output is correct
52 Correct 33 ms 1380 KB Output is correct
53 Correct 55 ms 1324 KB Output is correct
54 Correct 36 ms 1368 KB Output is correct
55 Correct 37 ms 1356 KB Output is correct
56 Correct 40 ms 1344 KB Output is correct
57 Correct 37 ms 1376 KB Output is correct
58 Correct 34 ms 1336 KB Output is correct
59 Correct 42 ms 1328 KB Output is correct
60 Correct 35 ms 1328 KB Output is correct
61 Correct 40 ms 1324 KB Output is correct
62 Correct 35 ms 1392 KB Output is correct
63 Correct 35 ms 1292 KB Output is correct
64 Correct 35 ms 1344 KB Output is correct
65 Correct 35 ms 1352 KB Output is correct
66 Correct 66 ms 1384 KB Output is correct
67 Correct 36 ms 1332 KB Output is correct
68 Correct 42 ms 1348 KB Output is correct
69 Correct 42 ms 1332 KB Output is correct
70 Correct 44 ms 1376 KB Output is correct
71 Correct 44 ms 1332 KB Output is correct
72 Correct 42 ms 1360 KB Output is correct
73 Correct 41 ms 1324 KB Output is correct
74 Correct 42 ms 1272 KB Output is correct
75 Correct 43 ms 1356 KB Output is correct
76 Correct 41 ms 1292 KB Output is correct
77 Correct 49 ms 1332 KB Output is correct
78 Correct 49 ms 1344 KB Output is correct
79 Correct 55 ms 1332 KB Output is correct

Subtask #5
0.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1396 KB Output is correct
2 Correct 28 ms 1324 KB Output is correct
3 Correct 24 ms 1320 KB Output is correct
4 Correct 25 ms 1312 KB Output is correct
5 Partially correct 41 ms 1328 KB Partially correct
6 Partially correct 41 ms 1320 KB Partially correct
7 Partially correct 40 ms 1320 KB Partially correct
8 Partially correct 48 ms 1320 KB Partially correct
9 Partially correct 38 ms 1328 KB Partially correct
10 Partially correct 37 ms 1316 KB Partially correct
11 Partially correct 50 ms 1348 KB Partially correct
12 Partially correct 54 ms 1324 KB Partially correct
13 Partially correct 45 ms 1336 KB Partially correct
14 Partially correct 42 ms 1364 KB Partially correct
15 Incorrect 13 ms 7112 KB Wrong Answer [4]
16 Halted 0 ms 0 KB -