QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#824943 | #9769. Rolling Stones | ucup-team5243# | AC ✓ | 1ms | 3980kb | C++23 | 11.9kb | 2024-12-21 16:37:32 | 2024-12-21 16:37:33 |
Judging History
answer
//line 1 "answer.cpp"
#if !__INCLUDE_LEVEL__
#include __FILE__
int main() {
ll n; input(n);
vvl a(n);
rep(i, n) {
a[i] = vl(2*i+1);
input(a[i]);
}
debug(a);
deque<pll> q;
auto d = a;
rep(i, n) rep(j, sz(d[i])) {d[i][j] = INFL;}
q.emplace_back(0,0);
d[0][0] = 0;
ll tx, ty; input(tx, ty); --tx, --ty;
const vector<pll> dxy = {{0, 1}, {0, -1}, {1, 1}, {-1, -1}};
while (!q.empty()) {
auto [x, y] = q.front(); q.pop_front();
debug(x, y);
if (x == tx && y == ty) {return print(d[tx][ty]);}
for (auto [dx, dy] : dxy) {
if (dx == 1 && dy == 1 && y % 2 == 1) continue;
if (dx == -1 && dy == -1 && y % 2 == 0) continue;
ll nx = x + dx, ny = y + dy;
debug(nx, ny);
if (nx < 0 || nx >= n) continue;
if (ny < 0 || ny >= sz(d[nx])) continue;
ll nid;
if (nx % 2 == 0) nid = 4 - ny % 4;
else nid = ny % 4 + 1;
debug(nid);
if (nid != a[nx][ny]) continue;
if (chmin(d[nx][ny], d[x][y] + 1)) {
q.emplace_back(nx, ny);
}
}
}
print(-1);
}
#else
//line 2 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp"
#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
// 型名の短縮
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
// 定数の定義
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-16;
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }
template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }
template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }
template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }
template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }
template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
// 入出力高速化
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto& a : (v)) // v の全要素(変更可能)
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};
template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> accum(const vector<T>& a) { vector<T> rev(sz(a)+1, 0); rep(i, sz(a)) rev[i+1] = rev[i] + a[i]; return rev; };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };
template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }
// modでのpow
ll powm(ll a, ll n, ll mod=INFL) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * a) % mod;
if (n > 1) a = (a * a) % mod;
n >>= 1;
}
return res;
}
// 整数Sqrt
ll sqrtll(ll x) {
assert(x >= 0);
ll rev = sqrt(x);
while(rev * rev > x) --rev;
while((rev+1) * (rev+1)<=x) ++rev;
return rev;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す)
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す)
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
/**
* @brief std.hpp
* @docs docs/std/std.md
*/
//line 3 "/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp"
// 演算子オーバーロード(プロトタイプ宣言)
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);
template <typename T> ostream &operator<<(ostream &os, queue<T> q);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <typename T> ostream &operator<<(ostream &os, stack<T> st);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);
// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }
template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };
template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {
cout << val << sep;
print_sep_end(sep, end, remain...);
return 0;
};
template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; };
template <typename... T> void flush() { cout << flush; };
template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };
#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print
template <typename T> void input(T &a) { cin >> a; };
template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };
#ifdef LOCAL_TEST
template <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
int scope = 0;
for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
cerr << name[i];
if (name[i] == '(' || name[i] == '{') scope++;
if (name[i] == ')' || name[i] == '}') scope--;
}
cerr << ":" << a << " ";
debug_func(i + 1, name, b...);
}
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {
int scope = 0;
for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) {
cerr << name[i];
if (name[i] == '(' || name[i] == '{') scope++;
if (name[i] == ')' || name[i] == '}') scope--;
}
cerr << ":" << a << " ";
debug_func(i + 1, name, b...);
}
#endif
#ifndef LOCAL_TEST
template <typename... T>
void debug_func(T &...) {}
template <typename... T>
void debug_func(const T &...) {}
#endif
/**
* @brief io.hpp
* @docs docs/std/io.md
*/
//line 44 "answer.cpp"
#endif
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3688kb
input:
3 4 3 2 3 4 3 2 1 3 3 1
output:
6
result:
ok 1 number(s): "6"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3528kb
input:
3 4 3 3 3 4 3 2 1 3 3 1
output:
-1
result:
ok 1 number(s): "-1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
2 4 1 3 3 2 3
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2 4 1 2 3 2 2
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
100 4 1 2 3 4 3 1 1 4 1 3 3 4 1 2 3 2 2 2 1 2 2 2 4 4 4 1 2 4 2 1 4 2 1 2 2 4 3 3 1 2 4 2 1 4 4 2 3 4 3 2 3 1 1 4 2 4 3 2 3 4 1 4 3 4 4 2 1 3 3 2 1 4 3 3 3 4 3 2 1 2 1 2 4 3 1 1 4 4 1 2 3 3 4 1 3 4 2 2 2 1 3 2 2 4 3 4 1 4 3 2 2 4 3 2 1 4 4 2 1 3 3 2 2 4 4 4 1 4 1 2 3 1 3 2 3 4 1 2 3 4 1 1 3 2 2 4 2 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3708kb
input:
100 4 1 3 3 2 3 2 1 4 1 1 1 4 1 4 3 4 2 2 1 4 3 2 1 4 4 3 3 4 1 2 2 4 3 4 2 4 3 2 1 1 2 2 1 4 4 2 1 2 1 2 3 4 1 2 1 4 4 4 3 4 1 4 3 1 3 4 2 3 4 3 1 4 2 2 1 4 1 1 3 4 2 2 3 4 3 2 2 4 4 1 3 4 2 2 3 4 3 1 3 3 3 3 2 4 3 2 2 4 3 1 1 4 3 1 1 4 1 2 2 3 1 2 2 4 3 2 3 3 2 4 3 4 1 2 2 4 3 1 4 4 1 2 3 4 4 4 2 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #7:
score: 0
Accepted
time: 1ms
memory: 3736kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 2 3 1 1 4 2 3 4 2 4 3 2 3 4 4 2 3 4 1 2 3 1 1 2 3 1 3 1 3 4 4 2 1 2 1 2 3 4 2 1 1 4 1 1 3 4 2 3 3 4 1 2 3 1 1 2 1 1 3 2 1 1 3 2 1 1 3 2 3 4 2 2 1 4 1 2 2 4 1 4 2 2 1 1 3 3 1 4 3 4 2 2 4 4 3 2 1 4 3 2 2 1 4 2 1 4 3 4 2 4 1 2 3 3 1 2 3 2 1 2 3 4 2 1 3 4 4 3 3 2 1 2 3 2 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #8:
score: 0
Accepted
time: 1ms
memory: 3664kb
input:
100 4 1 1 4 4 3 2 1 4 3 2 1 4 1 4 3 1 3 3 1 2 2 3 3 3 1 2 3 1 1 2 3 2 1 1 1 1 3 2 1 4 3 2 1 4 3 2 1 1 2 2 3 3 3 2 3 4 4 3 3 4 1 3 4 4 3 2 3 4 1 2 1 4 3 1 1 2 2 1 1 1 1 2 3 2 1 1 2 4 3 2 3 4 1 2 3 4 1 3 3 4 4 3 2 4 3 2 3 3 3 3 2 4 3 2 1 3 3 2 1 4 2 2 3 4 1 2 3 4 3 2 3 4 3 2 3 4 4 2 1 4 1 2 3 4 3 4 4 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3736kb
input:
100 4 1 4 3 4 3 3 1 4 1 2 3 4 1 2 3 1 3 1 1 4 3 2 1 4 1 2 3 2 2 1 1 4 3 2 4 4 3 1 3 4 3 3 2 2 3 1 3 2 3 2 4 4 1 2 3 3 1 4 3 4 1 3 1 4 4 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 3 1 3 4 1 2 1 4 1 2 3 4 1 1 3 2 3 2 1 2 3 2 1 4 4 2 1 2 3 2 1 4 3 1 1 4 1 2 4 4 1 3 3 4 1 2 2 4 1 2 3 4 4 4 3 2 1 2 1 4 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
100 4 4 1 3 4 3 2 1 1 4 2 2 4 1 2 4 2 3 1 2 1 3 2 1 4 1 3 3 4 1 2 1 4 1 4 3 3 3 2 1 1 3 2 2 4 3 2 1 4 1 2 3 1 1 2 3 4 1 3 3 3 1 2 1 4 1 2 1 4 3 2 1 4 2 2 1 4 3 2 1 4 2 4 3 2 1 2 3 2 1 3 3 4 2 2 3 4 1 2 3 4 3 2 1 4 2 2 2 4 3 2 1 4 2 2 1 3 3 4 4 4 1 2 3 1 3 2 3 4 2 2 3 4 1 2 3 4 1 2 2 4 1 3 1 4 3 2 2 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
100 4 1 2 3 1 3 2 1 2 1 2 2 4 4 4 3 2 3 2 3 4 3 2 1 4 1 2 4 4 1 2 1 4 1 4 3 2 3 1 1 2 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 4 3 4 3 2 3 4 3 2 1 4 3 2 2 4 3 2 1 4 3 2 1 4 1 2 3 4 1 1 3 4 4 3 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 4 1 1 3 3 2 4 4 2 1 4 3 2 3 3 1 2 3 4 1 2 4 4 1 2 1 4 1 2 3 3 4 3 2 4 1 3 3 2 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3968kb
input:
100 4 4 2 3 4 3 2 1 3 1 3 2 4 1 2 3 4 3 2 1 3 3 4 1 3 1 2 3 1 1 1 3 1 1 2 3 4 3 2 1 4 3 2 1 4 3 2 4 1 1 2 3 4 1 2 4 4 1 3 2 4 1 4 1 3 1 2 2 4 3 4 1 1 1 2 3 4 3 2 1 4 3 2 4 2 2 2 2 1 3 2 3 1 1 1 3 4 1 2 3 4 3 2 2 4 2 2 3 4 2 2 1 4 3 2 1 4 3 2 4 3 1 2 4 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 2 4 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3916kb
input:
100 4 1 2 3 4 3 2 4 4 1 2 3 4 4 2 3 4 3 2 4 4 3 3 1 4 3 1 3 4 1 2 3 4 1 2 1 4 3 2 1 4 3 2 1 4 4 3 1 4 1 2 3 4 1 2 3 4 1 2 3 1 1 4 3 4 1 2 3 4 3 2 1 4 3 2 1 4 4 3 1 3 1 2 1 4 2 2 4 4 1 2 3 4 1 2 3 3 2 2 3 4 1 3 1 4 3 2 2 4 1 2 1 3 3 2 1 4 1 2 3 4 1 2 3 4 3 3 1 4 1 2 3 1 1 2 3 4 1 2 3 3 1 2 3 4 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3728kb
input:
100 4 1 2 1 2 2 2 1 4 2 2 3 4 1 2 3 4 4 2 2 4 3 2 1 4 1 2 3 3 1 2 1 4 1 2 1 4 3 2 3 4 3 2 1 4 3 2 1 4 1 2 1 4 1 2 3 4 1 2 3 4 1 2 3 2 1 2 1 4 3 2 1 3 4 2 1 4 3 2 1 4 2 3 3 3 1 2 2 4 1 2 3 4 1 3 4 4 2 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 4 3 1 2 3 4 1 4 3 4 4 2 3 2 1 2 3 4 1 3 2 4 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #15:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
100 4 1 2 3 4 3 2 2 4 1 2 2 4 1 2 3 4 3 4 1 4 2 2 1 4 1 2 1 4 1 2 3 4 3 2 3 4 3 2 1 4 3 2 1 4 4 3 2 4 2 2 3 4 1 2 2 4 3 2 3 3 1 1 2 4 3 2 1 4 3 2 1 4 2 2 1 4 1 2 1 1 1 1 3 4 1 3 1 4 2 2 3 4 3 2 3 4 1 2 3 4 3 2 1 4 1 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 3 4 1 2 3 4 1 3 3 3 1 4 3 1 1 2 3 4 1 2 3 4 4 2 1 ...
output:
86
result:
ok 1 number(s): "86"
Test #16:
score: 0
Accepted
time: 1ms
memory: 3788kb
input:
100 4 1 2 3 1 3 2 1 4 1 2 3 4 2 2 3 4 1 2 1 3 3 2 3 4 3 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 2 4 1 2 1 4 1 2 3 4 1 2 1 4 1 2 3 4 2 2 3 4 2 2 1 4 3 2 2 4 3 2 1 3 3 2 1 4 1 2 3 3 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 4 2 1 4 3 2 1 4 1 2 3 4 4 2 3 4 1 2 3 4 1 2 3 2 1 2 4 1 1 2 3 4 3 3 1 ...
output:
207
result:
ok 1 number(s): "207"
Test #17:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 3 4 1 2 3 4 3 4 1 4 1 2 1 4 1 2 3 4 1 2 3 3 1 2 3 4 3 2 1 2 3 2 3 4 3 2 1 4 1 2 3 4 4 2 4 4 1 2 3 1 1 2 3 4 3 2 1 4 1 2 1 4 3 2 1 4 3 2 1 1 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 3 1 4 3 2 1 4 3 2 1 1 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 3 3 4 3 1 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #18:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
100 4 1 2 3 4 3 2 2 2 1 4 3 4 1 2 3 4 3 2 1 4 3 2 1 3 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 2 1 2 4 1 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 3 3 4 1 3 3 2 1 4 3 1 1 4 1 2 3 4 1 2 1 4 2 2 3 3 1 2 3 4 1 2 3 1 1 2 1 4 3 2 1 4 2 1 1 4 3 2 1 4 3 2 1 4 1 2 1 4 2 4 3 4 1 2 3 4 1 4 3 4 1 2 3 4 1 1 3 4 3 2 1 ...
output:
143
result:
ok 1 number(s): "143"
Test #19:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 1 4 1 2 3 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 3 2 3 4 3 1 3 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 1 4 1 2 3 1 3 2 1 4 3 2 1 4 3 1 4 4 3 2 1 4 1 2 3 4 1 4 3 4 1 2 3 4 1 2 3 4 4 2 4 3 3 2 1 4 3 2 4 4 3 2 1 4 4 1 1 4 3 2 1 4 1 2 3 4 1 1 3 4 1 2 3 1 1 2 2 4 1 2 3 4 1 2 3 4 3 2 1 ...
output:
179
result:
ok 1 number(s): "179"
Test #20:
score: 0
Accepted
time: 1ms
memory: 3776kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 3 2 1 2 2 4 3 2 1 2 1 2 1 4 1 2 3 4 1 2 3 4 1 3 3 4 3 2 1 4 3 2 4 4 3 2 1 4 2 2 3 4 1 2 3 4 1 3 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 4 2 3 4 1 2 3 4 1 2 2 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 2 4 1 2 3 4 3 2 3 4 1 2 3 4 1 2 3 4 2 4 3 4 3 2 1 ...
output:
2
result:
ok 1 number(s): "2"
Test #21:
score: 0
Accepted
time: 1ms
memory: 3696kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 3 4 1 2 3 4 3 2 4 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 1 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 2 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 4 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 ...
output:
-1
result:
ok 1 number(s): "-1"
Test #22:
score: 0
Accepted
time: 1ms
memory: 3912kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 1 3 3 4 1 2 3 4 1 2 3 4 3 2 2 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 3 2 3 4 2 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 3 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 4 3 4 1 2 3 3 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 ...
output:
160
result:
ok 1 number(s): "160"
Test #23:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
100 4 1 2 3 4 3 1 1 4 1 2 3 4 1 3 3 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 4 4 3 2 1 4 3 2 1 4 3 2 1 2 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 3 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 1 3 4 1 2 3 4 1 2 3 4 1 4 3 4 3 2 1 ...
output:
24
result:
ok 1 number(s): "24"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3980kb
input:
100 4 1 2 3 4 3 2 1 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 4 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 3 1 2 3 4 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 4 4 3 2 1 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 3 2 1 ...
output:
131
result:
ok 1 number(s): "131"
Test #25:
score: 0
Accepted
time: 1ms
memory: 3788kb
input:
100 4 1 2 3 4 3 2 4 4 1 2 2 4 1 2 3 4 4 2 1 4 2 2 1 4 1 2 3 4 4 2 3 4 4 2 3 4 3 2 2 4 3 2 2 4 3 2 3 4 1 2 2 4 1 2 1 4 1 2 4 4 1 2 3 4 2 2 1 4 4 2 1 4 4 2 1 4 1 2 1 4 1 2 3 4 3 2 3 4 3 2 3 4 3 2 3 4 2 2 3 4 3 2 4 4 3 2 4 4 3 2 2 4 3 2 3 4 3 2 2 4 1 2 2 4 1 2 4 4 1 2 4 4 1 2 4 4 1 2 4 4 1 2 3 4 2 2 1 ...
output:
7352
result:
ok 1 number(s): "7352"
Test #26:
score: 0
Accepted
time: 1ms
memory: 3772kb
input:
100 4 1 2 2 4 3 2 1 4 4 1 4 1 3 2 3 4 3 2 1 4 3 2 1 4 1 2 2 1 4 4 1 2 3 3 2 4 3 2 1 4 3 2 1 4 3 2 1 4 3 3 1 3 3 3 1 3 2 1 2 1 3 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 1 1 4 1 1 3 3 4 1 2 3 1 2 3 3 1 2 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 2 4 2 3 3 3 1 2 2 3 1 3 4 1 1 3 3 1 1 1 4 2 3 4 3 2 1 ...
output:
4996
result:
ok 1 number(s): "4996"
Test #27:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
100 4 1 2 3 4 3 2 4 4 1 2 1 4 1 2 3 4 4 2 1 4 1 2 1 4 1 2 3 4 4 2 3 4 3 2 3 4 3 2 4 4 3 2 2 4 3 2 3 4 1 2 2 4 1 2 1 4 1 2 2 4 1 2 3 4 4 2 1 4 4 2 1 4 1 2 1 4 2 2 1 4 1 2 3 4 3 2 3 4 4 2 3 4 4 2 3 4 2 2 3 4 3 2 4 4 3 2 2 4 3 2 2 4 3 2 2 4 3 2 3 4 1 2 4 4 1 2 1 4 1 2 2 4 1 2 2 4 1 2 2 4 1 2 3 4 2 2 1 ...
output:
3736
result:
ok 1 number(s): "3736"
Test #28:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
100 4 1 2 1 4 3 2 1 4 2 1 4 1 3 2 3 4 3 2 1 4 3 2 1 4 1 2 1 2 2 4 2 1 4 1 4 4 3 2 1 4 3 2 1 4 3 2 1 4 2 1 1 2 4 1 1 1 4 4 1 3 3 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 4 3 3 4 2 2 2 4 4 1 4 3 1 3 3 1 2 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 4 1 3 1 4 4 1 1 2 4 1 2 3 4 4 2 3 1 1 2 2 2 3 4 3 2 1 ...
output:
4716
result:
ok 1 number(s): "4716"
Test #29:
score: 0
Accepted
time: 1ms
memory: 3696kb
input:
100 4 1 2 3 4 3 2 4 4 1 2 1 4 1 2 3 4 1 2 1 4 2 2 1 4 1 2 3 4 4 2 3 4 4 2 3 4 3 2 2 4 3 2 4 4 3 2 4 4 1 2 2 4 1 2 1 4 1 2 1 4 1 2 3 4 2 2 1 4 4 2 1 4 1 2 1 4 1 2 1 4 1 2 3 4 4 2 3 4 4 2 3 4 4 2 3 4 4 2 3 4 3 2 3 4 3 2 3 4 3 2 4 4 3 2 4 4 3 2 3 4 1 2 1 4 1 2 2 4 1 2 4 4 1 2 4 4 1 2 1 4 1 2 3 4 2 2 1 ...
output:
2255
result:
ok 1 number(s): "2255"
Test #30:
score: 0
Accepted
time: 1ms
memory: 3752kb
input:
100 4 1 2 2 4 3 2 1 4 3 1 4 1 4 2 3 4 3 2 1 4 3 2 1 4 1 2 1 3 2 4 2 3 4 3 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 1 2 3 2 4 2 1 4 2 1 3 1 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 1 1 3 3 1 2 4 1 4 2 4 4 2 2 2 3 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 4 1 4 4 3 1 3 2 1 4 1 2 3 4 1 4 4 4 1 1 2 3 4 3 2 1 ...
output:
3598
result:
ok 1 number(s): "3598"
Test #31:
score: 0
Accepted
time: 1ms
memory: 3788kb
input:
100 4 1 2 3 4 3 2 4 4 1 2 2 4 1 2 3 4 2 2 1 4 4 2 1 4 1 2 3 4 2 2 3 4 3 2 3 4 3 2 3 4 3 2 4 4 3 2 3 4 1 2 4 4 1 2 2 4 1 2 2 4 1 2 3 4 4 2 1 4 4 2 1 4 1 2 1 4 1 2 1 4 1 2 3 4 3 2 3 4 3 2 3 4 3 2 3 4 3 2 3 4 3 2 4 4 3 2 3 4 3 2 2 4 3 2 4 4 3 2 4 4 1 2 2 4 1 2 1 4 1 2 3 4 1 2 4 4 1 2 1 4 1 2 3 4 1 2 1 ...
output:
2458
result:
ok 1 number(s): "2458"
Test #32:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
100 4 1 2 1 4 3 2 1 4 4 1 2 1 2 2 3 4 3 2 1 4 3 2 1 4 1 2 4 2 4 1 3 3 2 1 4 4 3 2 1 4 3 2 1 4 3 2 1 4 4 1 1 2 2 4 2 1 2 4 4 1 2 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 2 2 2 3 1 4 2 4 4 4 4 2 1 2 4 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 2 4 2 2 4 3 1 1 3 2 4 1 2 4 4 1 3 3 4 1 3 2 3 4 3 2 1 ...
output:
2009
result:
ok 1 number(s): "2009"
Test #33:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
100 4 1 2 3 4 3 2 2 4 1 2 4 4 1 2 3 4 2 2 1 4 1 2 1 4 1 2 3 4 4 2 3 4 2 2 3 4 3 2 2 4 3 2 4 4 3 2 4 4 1 2 4 4 1 2 4 4 1 2 2 4 1 2 3 4 1 2 1 4 2 2 1 4 2 2 1 4 4 2 1 4 1 2 3 4 3 2 3 4 4 2 3 4 3 2 3 4 2 2 3 4 3 2 4 4 3 2 2 4 3 2 4 4 3 2 4 4 3 2 2 4 1 2 1 4 1 2 1 4 1 2 2 4 1 2 4 4 1 2 4 4 1 2 3 4 2 2 1 ...
output:
1638
result:
ok 1 number(s): "1638"
Test #34:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
100 4 1 2 2 4 3 2 1 4 1 1 4 3 2 2 3 4 3 2 1 4 3 2 1 4 1 2 3 3 3 1 2 1 3 1 3 4 3 2 1 4 3 2 1 4 3 2 1 4 4 4 2 3 4 2 2 4 2 1 4 2 3 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 1 2 3 4 3 3 4 3 4 2 3 3 2 1 4 2 2 2 3 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 2 3 3 2 3 3 2 4 3 2 3 1 2 2 2 3 1 2 4 4 4 2 3 4 3 2 1 ...
output:
1723
result:
ok 1 number(s): "1723"
Test #35:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
100 4 1 2 3 3 3 2 4 4 1 2 3 4 4 2 3 1 3 2 4 4 3 2 1 4 1 2 3 4 2 2 3 2 1 2 3 3 3 2 2 4 3 2 1 2 3 2 4 4 1 2 3 4 2 2 3 2 1 2 3 4 4 2 3 3 3 2 4 4 3 2 1 1 3 2 2 4 3 2 1 4 1 2 3 4 4 2 3 3 1 2 3 4 2 2 3 2 1 2 3 1 3 2 4 4 3 2 1 3 3 2 2 4 3 2 1 2 3 2 2 4 1 2 3 4 2 2 3 2 1 2 3 4 4 2 3 1 1 2 3 4 3 2 3 1 3 2 3 ...
output:
7352
result:
ok 1 number(s): "7352"
Test #36:
score: 0
Accepted
time: 1ms
memory: 3736kb
input:
100 4 2 2 3 1 2 2 1 3 4 4 3 4 2 3 3 3 2 2 1 3 2 2 1 4 4 3 3 4 4 4 3 4 4 2 3 1 4 2 1 3 2 2 1 2 4 2 1 3 3 4 3 4 2 3 3 4 2 3 3 4 4 4 3 2 4 2 1 3 1 2 1 3 1 2 1 1 1 2 1 4 4 4 3 4 2 3 3 4 4 3 3 4 4 4 3 4 4 2 3 1 4 2 1 1 4 2 1 3 4 2 1 2 1 2 1 2 4 2 1 2 4 1 3 4 3 4 3 4 2 1 3 4 4 4 3 4 4 1 3 4 4 1 3 1 4 2 1 ...
output:
4998
result:
ok 1 number(s): "4998"
Test #37:
score: 0
Accepted
time: 1ms
memory: 3972kb
input:
100 4 1 2 3 1 3 2 4 4 1 2 3 4 4 2 3 2 3 2 4 4 3 2 1 4 1 2 3 4 3 2 3 4 1 2 3 1 3 2 2 4 3 2 1 1 3 2 4 4 1 2 3 4 2 2 3 2 1 2 3 4 3 2 3 3 3 2 2 4 3 2 1 2 3 2 4 4 3 2 1 4 1 2 3 4 4 2 3 1 1 2 3 4 2 2 3 3 1 2 3 2 3 2 2 4 3 2 1 2 3 2 2 4 3 2 1 1 3 2 2 4 1 2 3 4 2 2 3 3 1 2 3 4 4 2 3 2 1 2 3 4 3 2 3 1 3 2 3 ...
output:
3288
result:
ok 1 number(s): "3288"
Test #38:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
100 4 1 2 3 1 2 2 1 2 3 4 3 4 4 1 3 2 3 2 1 2 4 2 1 4 3 1 3 4 4 3 3 4 4 2 3 3 2 2 1 3 2 2 1 2 4 2 1 3 3 1 3 4 4 3 3 4 4 1 3 4 2 4 3 2 1 2 1 2 2 2 1 2 2 2 1 3 2 2 1 4 2 1 3 4 3 3 3 4 3 1 3 4 4 4 3 4 3 2 3 2 1 2 1 2 1 2 1 2 4 2 1 3 4 2 1 1 4 2 1 1 2 1 3 4 1 4 3 4 3 4 3 4 3 4 3 4 2 4 3 4 3 3 3 2 2 2 1 ...
output:
4607
result:
ok 1 number(s): "4607"
Test #39:
score: 0
Accepted
time: 1ms
memory: 3744kb
input:
100 4 1 2 3 1 3 2 2 4 1 2 3 4 2 2 3 3 3 2 2 4 3 2 1 4 1 2 3 4 3 2 3 2 1 2 3 1 3 2 3 4 3 2 1 1 3 2 3 4 1 2 3 4 2 2 3 1 1 2 3 4 3 2 3 1 3 2 2 4 3 2 1 2 3 2 2 4 3 2 1 4 1 2 3 4 2 2 3 1 1 2 3 4 4 2 3 2 1 2 3 1 3 2 3 4 3 2 1 4 3 2 3 4 3 2 1 2 3 2 3 4 1 2 3 4 3 2 3 1 1 2 3 4 3 2 3 2 1 2 3 4 2 2 3 2 3 2 3 ...
output:
2271
result:
ok 1 number(s): "2271"
Test #40:
score: 0
Accepted
time: 1ms
memory: 3908kb
input:
100 4 4 2 3 2 2 2 1 3 2 4 3 4 2 4 3 1 2 2 1 3 2 2 1 4 2 1 3 4 3 4 3 4 2 2 3 2 4 2 1 3 1 2 1 1 2 2 1 1 2 1 3 4 1 3 3 4 4 4 3 4 2 3 3 3 4 2 1 3 4 2 1 1 1 2 1 2 1 2 1 4 4 3 3 4 4 1 3 4 3 1 3 4 3 4 3 4 2 2 3 3 4 2 1 1 1 2 1 2 4 2 1 3 4 2 1 2 1 2 1 2 3 1 3 4 2 4 3 4 4 3 3 4 4 4 3 4 2 1 3 4 4 4 3 2 2 2 1 ...
output:
2950
result:
ok 1 number(s): "2950"
Test #41:
score: 0
Accepted
time: 1ms
memory: 3856kb
input:
100 4 1 2 3 1 3 2 4 4 1 2 3 4 3 2 3 1 3 2 2 4 3 2 1 4 1 2 3 4 4 2 3 1 1 2 3 2 3 2 3 4 3 2 1 3 3 2 2 4 1 2 3 4 3 2 3 3 1 2 3 4 3 2 3 3 3 2 3 4 3 2 1 3 3 2 2 4 3 2 1 4 1 2 3 4 4 2 3 1 1 2 3 4 3 2 3 2 1 2 3 1 3 2 2 4 3 2 1 3 3 2 4 4 3 2 1 1 3 2 4 4 1 2 3 4 2 2 3 3 1 2 3 4 4 2 3 1 1 2 3 4 2 2 3 1 3 2 3 ...
output:
1618
result:
ok 1 number(s): "1618"
Test #42:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
100 4 2 2 3 2 2 2 1 1 2 1 3 4 2 4 3 4 1 2 1 2 3 2 1 4 2 3 3 4 4 3 3 4 3 2 3 2 1 2 1 2 1 2 1 3 4 2 1 3 1 1 3 4 4 3 3 4 2 3 3 4 4 3 3 3 1 2 1 2 3 2 1 4 4 2 1 3 1 2 1 4 4 3 3 4 3 4 3 4 2 4 3 4 3 4 3 4 4 2 3 1 1 2 1 3 1 2 1 1 2 2 1 4 2 2 1 1 4 2 1 4 2 4 3 4 4 4 3 4 3 4 3 4 2 4 3 4 4 3 3 4 1 1 3 4 4 2 1 ...
output:
2054
result:
ok 1 number(s): "2054"
Test #43:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
100 4 1 2 3 3 3 2 4 4 1 2 3 4 2 2 3 4 3 2 2 4 3 2 1 4 1 2 3 4 2 2 3 1 1 2 3 4 3 2 4 4 3 2 1 2 3 2 3 4 1 2 3 4 2 2 3 3 1 2 3 4 4 2 3 3 3 2 2 4 3 2 1 1 3 2 3 4 3 2 1 4 1 2 3 4 3 2 3 1 1 2 3 4 3 2 3 3 1 2 3 1 3 2 4 4 3 2 1 3 3 2 4 4 3 2 1 2 3 2 4 4 1 2 3 4 3 2 3 2 1 2 3 4 3 2 3 1 1 2 3 4 2 2 3 1 3 2 2 ...
output:
1217
result:
ok 1 number(s): "1217"
Test #44:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
100 4 2 2 3 1 1 2 1 1 1 3 3 4 2 1 3 3 2 2 1 1 4 2 1 4 1 1 3 4 4 3 3 4 3 2 3 1 4 2 1 2 2 2 1 3 1 2 1 1 2 1 3 4 2 3 3 4 4 3 3 4 3 1 3 1 1 2 1 3 4 2 1 2 2 2 1 3 4 2 1 4 3 3 3 4 1 1 3 4 4 4 3 4 4 1 3 4 3 2 3 3 1 2 1 3 4 2 1 3 2 2 1 2 3 2 1 4 1 2 1 2 2 3 3 4 4 4 3 4 4 3 3 4 4 1 3 4 3 3 3 4 4 1 3 4 2 2 1 ...
output:
1546
result:
ok 1 number(s): "1546"
Test #45:
score: 0
Accepted
time: 1ms
memory: 3720kb
input:
100 4 3 2 3 4 3 2 1 3 1 2 1 1 1 2 3 2 3 2 1 4 1 2 1 2 1 2 3 3 1 2 2 4 1 2 3 4 4 2 1 4 3 1 2 3 4 2 1 4 1 2 4 4 1 1 3 4 1 4 3 4 1 3 3 4 3 2 3 4 3 4 1 3 3 2 1 2 3 2 1 2 1 2 3 3 1 2 2 3 3 1 2 4 2 2 3 4 1 2 3 4 3 3 1 2 3 2 1 4 4 2 1 4 3 2 2 4 3 1 1 4 1 2 3 1 1 2 3 1 2 2 3 4 4 4 3 4 1 1 3 4 2 2 3 4 3 4 4 ...
output:
320
result:
ok 1 number(s): "320"
Test #46:
score: 0
Accepted
time: 1ms
memory: 3720kb
input:
100 4 4 2 3 4 3 3 1 4 1 2 3 3 1 2 4 4 3 2 3 4 3 1 1 4 2 2 3 3 1 2 4 4 1 2 3 4 3 2 1 2 3 2 1 4 4 2 1 4 1 2 1 4 1 2 3 1 1 2 2 4 4 2 3 4 3 2 4 4 3 1 4 4 3 3 1 4 3 2 1 4 1 2 4 4 1 4 3 4 1 2 4 4 1 2 3 1 1 2 3 4 3 4 4 1 3 2 1 2 4 2 1 4 4 3 1 4 1 2 1 4 1 2 2 4 1 2 3 2 1 2 3 4 4 2 3 4 1 1 1 4 1 4 2 4 3 3 1 ...
output:
1027
result:
ok 1 number(s): "1027"
Test #47:
score: 0
Accepted
time: 1ms
memory: 3740kb
input:
100 4 1 2 1 2 3 2 1 4 1 2 3 1 1 2 2 4 3 1 1 4 3 3 1 4 4 2 3 4 1 1 3 4 1 2 3 4 3 2 3 4 3 4 1 4 2 2 1 4 1 2 3 3 1 2 1 4 1 2 3 2 3 2 3 4 1 2 1 3 3 2 1 4 1 4 1 4 3 2 2 4 1 2 3 4 1 2 3 1 4 2 3 4 1 1 3 4 1 2 3 4 3 3 1 4 2 4 1 4 3 2 3 3 3 2 3 4 2 2 1 4 1 2 3 4 4 2 3 4 1 3 3 4 1 2 2 4 1 2 3 4 2 2 3 4 4 2 1 ...
output:
1147
result:
ok 1 number(s): "1147"
Test #48:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
100 4 1 2 3 4 1 2 1 1 1 2 2 4 1 2 3 4 3 2 1 2 1 2 1 3 1 2 3 3 1 2 3 4 3 2 3 4 3 4 1 3 3 2 3 4 3 1 1 4 1 2 3 4 1 2 3 4 3 2 3 4 1 2 3 4 3 3 1 4 1 2 4 4 3 2 3 4 3 1 1 4 3 2 3 4 1 4 3 4 1 2 1 4 4 2 3 4 3 2 3 4 3 2 2 4 3 1 1 2 3 2 1 4 3 2 1 1 4 3 1 4 1 2 2 4 4 2 3 2 1 2 3 4 2 3 3 2 1 2 3 4 2 2 3 4 3 2 1 ...
output:
2292
result:
ok 1 number(s): "2292"
Test #49:
score: 0
Accepted
time: 1ms
memory: 3696kb
input:
100 4 1 2 4 3 3 2 1 4 1 2 3 2 1 2 3 4 3 1 1 2 3 1 1 4 1 2 3 4 1 2 3 4 2 2 3 4 3 3 1 4 1 2 1 4 3 3 1 4 1 4 3 4 1 3 3 4 4 2 2 4 1 2 3 4 3 2 1 1 3 2 1 4 4 2 1 4 3 1 1 4 3 2 3 3 1 2 3 4 1 3 3 4 4 4 3 4 1 3 3 4 3 2 1 1 3 2 3 4 1 2 1 3 3 2 1 1 3 2 1 3 1 2 3 3 1 2 3 4 3 2 3 4 1 4 3 4 1 2 2 2 1 2 3 4 3 4 1 ...
output:
67
result:
ok 1 number(s): "67"
Test #50:
score: 0
Accepted
time: 1ms
memory: 3780kb
input:
100 4 4 2 3 4 3 1 1 4 1 2 3 2 1 2 1 4 3 2 4 3 3 2 1 4 1 3 3 4 1 2 4 4 1 1 3 4 3 2 1 4 1 2 1 4 3 4 1 4 1 2 2 4 1 3 1 4 1 1 2 4 1 2 3 2 3 2 1 1 3 2 1 3 3 2 1 4 2 2 1 4 1 2 3 4 1 3 3 4 3 2 3 3 2 2 3 3 1 2 3 4 3 3 1 2 3 4 1 4 3 2 1 4 3 4 1 4 1 2 1 4 3 3 3 4 1 2 3 4 1 4 3 4 1 3 2 1 4 2 3 1 1 2 3 4 2 2 1 ...
output:
532
result:
ok 1 number(s): "532"
Test #51:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
100 4 2 2 3 4 3 2 1 3 3 2 3 3 1 2 3 4 3 4 1 4 2 2 1 4 1 2 3 4 1 2 1 4 4 2 3 4 3 2 3 4 1 2 1 4 3 2 1 4 4 2 3 3 1 2 3 3 1 2 3 1 1 2 4 4 3 1 1 4 3 1 1 4 3 3 1 2 3 2 1 4 1 2 3 4 1 1 4 4 1 3 3 4 1 2 3 1 1 2 3 4 3 3 1 2 3 2 1 4 3 2 4 4 3 3 1 2 3 2 3 4 1 2 4 4 1 3 3 4 2 2 2 4 1 2 3 3 1 2 2 4 1 2 3 1 3 2 3 ...
output:
275
result:
ok 1 number(s): "275"
Test #52:
score: 0
Accepted
time: 1ms
memory: 3716kb
input:
100 4 4 2 3 4 3 1 1 4 1 2 3 3 1 2 2 4 2 2 1 4 3 3 1 4 1 2 3 4 2 1 3 4 1 2 3 4 2 2 1 1 3 2 1 4 2 2 1 4 1 2 2 4 1 2 2 4 1 3 3 4 4 2 3 4 3 2 1 1 3 2 1 4 1 2 1 1 3 2 1 4 3 4 3 4 4 2 3 2 2 2 3 4 3 2 3 4 2 2 3 4 1 2 1 4 3 2 1 4 3 2 2 1 2 1 1 4 3 2 3 4 1 2 3 4 3 4 3 2 1 1 4 4 1 1 3 4 1 1 4 4 1 2 3 4 3 2 2 ...
output:
54
result:
ok 1 number(s): "54"
Test #53:
score: 0
Accepted
time: 1ms
memory: 3788kb
input:
100 4 1 2 1 4 3 1 1 4 1 2 2 3 3 2 3 3 3 2 1 4 3 2 1 4 1 2 3 1 1 4 1 2 1 2 4 4 3 2 4 4 3 2 2 4 3 3 1 4 1 2 1 4 1 2 4 4 1 2 2 3 3 2 3 4 3 3 4 2 1 2 1 4 2 2 1 4 3 2 1 4 4 2 3 4 1 4 3 4 4 2 3 4 3 2 1 4 1 4 3 4 3 2 4 3 3 2 2 4 3 2 1 2 4 3 1 4 3 2 1 4 1 2 4 4 1 2 4 4 1 3 4 4 1 2 3 4 1 4 3 4 2 2 3 2 3 2 3 ...
output:
1360
result:
ok 1 number(s): "1360"
Test #54:
score: 0
Accepted
time: 1ms
memory: 3696kb
input:
100 4 3 2 3 4 3 1 1 4 1 2 3 1 1 2 4 3 2 2 1 3 3 2 1 4 1 4 3 4 1 2 3 2 1 2 4 4 3 2 1 1 3 2 2 4 3 1 1 4 1 2 3 1 1 2 2 4 1 2 1 4 1 2 3 4 3 2 4 4 3 2 1 4 4 2 1 4 4 2 1 4 1 1 3 4 2 2 3 1 1 2 3 2 1 2 3 4 1 1 3 4 3 2 1 2 3 2 1 1 3 1 1 4 2 2 1 1 3 2 1 4 1 3 3 4 4 2 3 4 3 2 3 4 1 2 1 4 1 2 3 1 1 2 1 4 3 3 1 ...
output:
2448
result:
ok 1 number(s): "2448"
Test #55:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
3 4 3 2 3 3 3 2 1 3 3 1
output:
-1
result:
ok 1 number(s): "-1"
Extra Test:
score: 0
Extra Test Passed