QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#489050 | #7956. Walk Swapping | arnold518 | TL | 746ms | 4468kb | C++17 | 4.3kb | 2024-07-24 17:08:51 | 2024-07-24 17:08:51 |
Judging History
answer
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 6000;
const int INF = 1e9;
template<int MOD>
struct mint
{
int x;
mint() : x(0) {}
mint(int _x) : x(_x) {}
mint operator + (int ot) const { return x+ot>=MOD ? x+ot-MOD : x+ot; }
mint operator - (int ot) const { return x<ot ? x+MOD-ot : x-ot; }
mint operator - () const { return x ? MOD-x : 0; }
mint operator * (int ot) const { return 1ll*x*ot%MOD; }
mint operator += (int ot) { return *this = *this + ot; }
mint operator -= (int ot) { return *this = *this - ot; }
mint operator *= (int ot) { return *this = *this * ot; }
operator int() const { return x; }
bool operator < (int ot) const { return x<ot; }
};
template<int MOD>
mint<MOD> mpow(mint<MOD> a, ll b)
{
mint<MOD> ret=1;
while(b)
{
if(b&1) ret*=a;
b>>=1; a=a*a;
}
return ret;
}
template<int MOD>
mint<MOD> inv(mint<MOD> a) { return mpow<MOD>(a, MOD-2); }
const int MOD1 = 1e9+7;
const int MOD2 = 998244353;
const int P1 = 3;
const int P2 = 7;
typedef pair<mint<MOD1>, mint<MOD2>> pmm;
pmm operator + (const pmm &p, const pmm &q) { return {p.first+q.first, p.second+q.second}; }
pmm operator - (const pmm &p, const pmm &q) { return {p.first-q.first, p.second-q.second}; }
pmm operator * (const pmm &p, const pmm &q) { return {p.first*q.first, p.second*q.second}; }
pmm operator - (const pmm &p) { return {-p.first, -p.second}; }
pmm& operator += (pmm &p, const pmm &q) { p=p+q; return p; }
pmm& operator -= (pmm &p, const pmm &q) { p=p-q; return p; }
pmm& operator *= (pmm &p, const pmm &q) { p=p*q; return p; }
pmm mpow(pmm a, ll b) { return {mpow(a.first, b), mpow(a.second, b)}; }
pmm inv(pmm a) { return {inv(a.first), inv(a.second)}; }
int N, A[MAXN+10], B[MAXN+10];
pmm PP[MAXN+10], IP[MAXN+10];
pmm HA[MAXN+10], HB[MAXN+10];
int ans=INF;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
scanf("%d", &N);
for(int i=1; i<=N; i++) scanf("%d", &A[i]);
for(int i=1; i<=N; i++) scanf("%d", &B[i]);
{
vector<int> VA, VB;
for(int i=1; i<=N; i++) VA.push_back(A[i]);
for(int i=1; i<=N; i++) VB.push_back(B[i]);
sort(VA.begin(), VA.end());
sort(VB.begin(), VB.end());
if(VA!=VB) return !printf("-1\n");
}
if(N==1) return !printf("0\n");
for(int i=1; i<=N; i++) A[i+N]=A[i], B[i+N]=B[i];
PP[0]={1, 1}; IP[0]={1, 1};
PP[1]={P1, P2}; IP[1]=inv(PP[1]);
for(int i=2; i<=N+N; i++) PP[i]=PP[i-1]*PP[1];
for(int i=2; i<=N+N; i++) IP[i]=IP[i-1]*IP[1];
for(int i=1; i<=N+N; i++) HA[i]=HA[i-1]+PP[i]*pmm{A[i], A[i]};
for(int i=1; i<=N+N; i++) HB[i]=HB[i-1]+PP[i]*pmm{B[i], B[i]};
vector<pair<pmm, int>> V4;
for(int i=1; i<N; i++) V4.push_back({(HA[N-1]-HA[i-1])*IP[i-1] + HA[i-1]*PP[N-i], i});
sort(V4.begin(), V4.end());
for(int cyc=0; cyc<N; cyc++)
{
vector<pair<pmm, int>> V, V2, V3;
for(int i=1; i<=N; i++) if(B[i+cyc]==A[cyc+1] || B[i+cyc]==A[cyc+N]) V.push_back({(HB[cyc+i-1]-HB[cyc])*IP[cyc]+(HB[cyc+N]-HB[cyc+i])*IP[cyc+1], cyc+i});
for(int i=2; i<=N; i++) V2.push_back({(HA[cyc+N]-HA[cyc+i-1])*IP[cyc+i-1] + (HA[cyc+i-1]-HA[cyc+1])*IP[cyc]*PP[N-i], cyc+i});
V3=V4;
sort(V.begin(), V.end());
sort(V2.begin(), V2.end());
for(int l=0, r, j=0; l<V2.size(); l=r)
{
for(r=l; r<V2.size() && V2[r].first==V2[l].first; r++);
int val=INF;
for(; j<V.size() && V[j].first<=V2[l].first; j++) if(V[j].first==V2[l].first) val=min(val, V[j].second);
if(val!=INF) for(int i=l; i<r; i++) ans=min(ans, (V2[i].second-2-cyc)*N+val-1-cyc);
}
for(int l=0, r, j=0; l<V3.size(); l=r)
{
for(r=l; r<V3.size() && V3[r].first==V3[l].first; r++);
int val=0;
for(; j<V.size() && V[j].first<=V3[l].first; j++) if(V[j].first==V3[l].first) val=max(val, V[j].second);
if(val!=0) for(int i=l; i<r; i++) ans=min(ans, (N+cyc-V3[i].second)%(N-1)*N+N+cyc-val);
}
V4=V2;
}
if(ans==INF) printf("-1\n");
else printf("%d\n", ans);
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 4088kb
input:
4 4 3 2 1 3 4 2 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 4296kb
input:
6 2 1 1 2 2 1 1 2 2 2 1 1
output:
7
result:
ok single line: '7'
Test #3:
score: 0
Accepted
time: 0ms
memory: 4036kb
input:
6 4 1 3 6 2 5 6 2 1 3 4 5
output:
-1
result:
ok single line: '-1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 4012kb
input:
4 1 2 3 4 4 2 1 3
output:
2
result:
ok single line: '2'
Test #5:
score: 0
Accepted
time: 0ms
memory: 4012kb
input:
6 4 1 3 6 2 5 6 2 5 3 4 1
output:
13
result:
ok single line: '13'
Test #6:
score: 0
Accepted
time: 0ms
memory: 4300kb
input:
6 4 1 3 3 2 5 3 2 5 3 4 1
output:
12
result:
ok single line: '12'
Test #7:
score: 0
Accepted
time: 0ms
memory: 4304kb
input:
4 4 3 2 1 1 3 2 4
output:
1
result:
ok single line: '1'
Test #8:
score: 0
Accepted
time: 0ms
memory: 4008kb
input:
5 4 3 5 2 1 1 3 5 4 2
output:
2
result:
ok single line: '2'
Test #9:
score: 0
Accepted
time: 0ms
memory: 4036kb
input:
5 4 3 5 2 1 1 4 3 5 2
output:
4
result:
ok single line: '4'
Test #10:
score: 0
Accepted
time: 0ms
memory: 4296kb
input:
5 1 1 1 2 1 2 1 1 1 1
output:
2
result:
ok single line: '2'
Test #11:
score: 0
Accepted
time: 0ms
memory: 4292kb
input:
4 4 3 2 1 1 3 2 4
output:
1
result:
ok single line: '1'
Test #12:
score: 0
Accepted
time: 0ms
memory: 4016kb
input:
4 4 3 2 1 1 3 4 2
output:
2
result:
ok single line: '2'
Test #13:
score: 0
Accepted
time: 0ms
memory: 4040kb
input:
10 2 3 1 1 3 4 5 5 6 1 1 1 3 4 5 3 5 1 7 2
output:
-1
result:
ok single line: '-1'
Test #14:
score: 0
Accepted
time: 0ms
memory: 4032kb
input:
5 1 4 5 3 2 5 3 2 1 4
output:
8
result:
ok single line: '8'
Test #15:
score: 0
Accepted
time: 0ms
memory: 4296kb
input:
5 1 2 3 4 5 5 2 1 3 4
output:
3
result:
ok single line: '3'
Test #16:
score: 0
Accepted
time: 0ms
memory: 4024kb
input:
10 1 2 3 4 5 6 7 8 9 10 8 4 2 3 1 5 7 6 9 10
output:
-1
result:
ok single line: '-1'
Test #17:
score: 0
Accepted
time: 0ms
memory: 4004kb
input:
10 1 2 3 2 2 2 1 1 1 1 2 1 1 1 1 1 2 2 3 2
output:
41
result:
ok single line: '41'
Test #18:
score: 0
Accepted
time: 1ms
memory: 4036kb
input:
10 1 1 1 2 2 4 4 4 2 2 1 1 2 2 4 4 2 2 1 4
output:
12
result:
ok single line: '12'
Test #19:
score: 0
Accepted
time: 0ms
memory: 4308kb
input:
12 3 3 3 2 2 2 4 4 2 2 1 3 3 3 2 2 4 4 2 2 2 1 3 3
output:
13
result:
ok single line: '13'
Test #20:
score: 0
Accepted
time: 0ms
memory: 4296kb
input:
12 3 3 2 2 2 2 4 4 2 2 1 2 2 2 2 2 4 4 2 2 2 1 3 3
output:
19
result:
ok single line: '19'
Test #21:
score: 0
Accepted
time: 0ms
memory: 3968kb
input:
12 3 3 2 4 2 2 4 4 2 2 1 2 2 2 2 2 4 4 2 2 4 1 3 3
output:
-1
result:
ok single line: '-1'
Test #22:
score: 0
Accepted
time: 1ms
memory: 4036kb
input:
20 3 4 4 5 1 2 3 2 5 1 1 5 3 2 4 5 1 2 3 5 2 3 5 4 4 5 1 2 3 2 5 3 1 1 5 3 2 4 5 1
output:
49
result:
ok single line: '49'
Test #23:
score: 0
Accepted
time: 1ms
memory: 4012kb
input:
20 3 4 4 5 1 2 3 2 5 1 1 5 3 2 4 5 1 2 3 5 3 2 3 4 5 1 2 3 5 4 4 5 1 2 3 2 5 1 1 5
output:
158
result:
ok single line: '158'
Test #24:
score: 0
Accepted
time: 1ms
memory: 3976kb
input:
100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 99 1...
output:
109
result:
ok single line: '109'
Test #25:
score: 0
Accepted
time: 1ms
memory: 4272kb
input:
100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 100 ...
output:
89
result:
ok single line: '89'
Test #26:
score: 0
Accepted
time: 1ms
memory: 4100kb
input:
100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 51 5...
output:
4924
result:
ok single line: '4924'
Test #27:
score: 0
Accepted
time: 1ms
memory: 4108kb
input:
100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 51 5...
output:
4905
result:
ok single line: '4905'
Test #28:
score: 0
Accepted
time: 1ms
memory: 4300kb
input:
100 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 6 6 6 6 6 7 7 7 7 7 8 8 8 8 8 9 9 9 9 9 10 10 10 10 10 11 11 11 11 11 12 12 12 12 12 13 13 13 13 13 14 14 14 14 14 15 15 15 15 15 16 16 16 16 16 17 17 17 17 17 18 18 18 18 18 19 19 19 19 19 20 20 20 20 20 9 9 9 9 9 10 10 10 10 10 11 11 11 11 11 1...
output:
3990
result:
ok single line: '3990'
Test #29:
score: 0
Accepted
time: 1ms
memory: 4300kb
input:
100 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 ...
output:
125
result:
ok single line: '125'
Test #30:
score: 0
Accepted
time: 0ms
memory: 4036kb
input:
100 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 6 6 6 6 6 7 7 7 7 7 8 8 8 8 8 9 9 9 9 9 10 10 10 10 10 11 11 11 11 11 12 12 12 12 12 13 13 13 13 13 14 14 14 14 14 15 15 15 15 15 16 16 16 16 16 17 17 17 17 17 18 18 18 18 18 19 19 19 19 19 20 20 20 20 20 9 9 9 9 9 10 10 10 10 10 11 11 11 15 11 1...
output:
-1
result:
ok single line: '-1'
Test #31:
score: 0
Accepted
time: 1ms
memory: 4036kb
input:
100 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 ...
output:
79
result:
ok single line: '79'
Test #32:
score: 0
Accepted
time: 1ms
memory: 4240kb
input:
100 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 ...
output:
-1
result:
ok single line: '-1'
Test #33:
score: 0
Accepted
time: 1ms
memory: 4084kb
input:
100 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3 ...
output:
0
result:
ok single line: '0'
Test #34:
score: 0
Accepted
time: 60ms
memory: 4364kb
input:
1000 458 51 4 190 103 444 401 456 34 970 169 517 283 66 571 282 233 161 32 376 168 616 993 347 213 597 334 652 471 532 552 987 353 613 665 305 477 632 331 293 939 598 175 813 10 890 423 560 502 857 277 18 283 461 6 231 233 648 929 75 896 807 900 2 582 84 81 107 255 145 909 562 492 58 218 575 7 610 6...
output:
243210
result:
ok single line: '243210'
Test #35:
score: 0
Accepted
time: 56ms
memory: 4080kb
input:
1000 323 302 194 991 814 729 763 611 294 128 752 772 136 693 300 575 118 965 888 999 288 837 534 470 436 195 8 958 448 216 697 295 53 341 577 460 543 724 79 593 490 800 218 336 7 448 401 716 7 920 740 21 87 208 202 422 812 528 196 475 633 732 170 423 975 901 412 117 829 457 420 941 664 644 858 473 9...
output:
243013
result:
ok single line: '243013'
Test #36:
score: 0
Accepted
time: 587ms
memory: 4468kb
input:
3000 2057 2074 2349 1090 597 671 2074 92 892 304 1749 2393 935 2200 2859 293 2392 127 1960 1991 1842 2447 1783 1669 599 1936 887 1490 296 478 2334 250 864 1697 1833 325 1801 2950 2704 51 1868 2860 820 1495 1123 1 2122 2135 1826 294 612 1771 2181 160 1358 587 931 409 934 2622 516 2199 399 1008 1446 3...
output:
1788777
result:
ok single line: '1788777'
Test #37:
score: 0
Accepted
time: 587ms
memory: 4192kb
input:
3000 324 151 600 776 956 914 289 189 861 149 898 483 603 415 202 265 317 689 383 59 610 507 832 589 689 135 67 296 941 795 53 539 385 469 824 742 232 843 890 363 768 144 132 991 472 142 671 655 327 648 310 46 47 654 344 326 91 79 852 109 620 514 43 114 538 374 160 296 897 755 995 514 746 304 830 455...
output:
1100867
result:
ok single line: '1100867'
Test #38:
score: 0
Accepted
time: 588ms
memory: 4252kb
input:
3000 1991 2302 2034 674 671 2189 1348 2644 189 991 1293 60 489 514 1203 1906 2376 2579 482 2083 2116 2055 278 1787 445 1557 1583 373 1959 523 322 2449 1643 1654 734 24 1211 1758 2876 261 1936 2105 1482 2069 1894 974 673 392 1739 1181 758 576 1004 2645 1782 2817 152 2654 2694 2553 1897 2937 130 1178 ...
output:
742350
result:
ok single line: '742350'
Test #39:
score: 0
Accepted
time: 586ms
memory: 4196kb
input:
3000 527 569 638 129 325 581 270 91 113 516 804 284 17 367 470 304 847 659 40 504 483 25 109 300 268 189 9 409 405 337 957 468 573 515 115 429 905 252 170 134 998 786 564 742 410 512 598 641 234 884 231 859 530 170 349 653 704 439 381 215 505 337 521 423 88 941 951 17 892 960 263 991 642 482 5 418 8...
output:
1930377
result:
ok single line: '1930377'
Test #40:
score: 0
Accepted
time: 606ms
memory: 4192kb
input:
3000 3 72 35 97 25 59 36 93 74 34 78 47 60 99 94 62 82 66 81 66 79 50 18 24 83 39 97 27 17 69 43 40 88 84 34 73 33 60 46 61 88 59 85 79 43 1 27 8 39 11 24 53 72 47 66 78 15 79 89 84 54 84 94 21 12 44 48 1 5 27 13 67 64 27 92 86 80 90 21 61 40 57 70 50 34 86 84 86 9 25 38 75 81 82 1 50 72 25 15 15 7 ...
output:
1072255
result:
ok single line: '1072255'
Test #41:
score: 0
Accepted
time: 746ms
memory: 4196kb
input:
3000 8 8 7 4 4 3 2 4 3 2 8 7 10 7 2 3 8 6 4 2 1 4 1 3 1 4 2 4 4 1 8 9 4 9 4 6 9 3 4 3 6 5 5 10 7 10 7 3 5 7 2 8 9 8 9 7 6 7 1 9 6 6 10 4 2 7 8 9 7 2 10 4 3 7 4 9 4 9 10 3 5 10 1 3 7 6 1 10 4 9 4 7 6 4 2 8 1 5 6 9 4 10 8 1 5 10 7 9 7 3 6 1 2 7 4 1 3 7 9 10 3 3 6 10 6 4 1 7 3 9 3 9 4 6 3 5 2 8 5 1 2 2...
output:
3327362
result:
ok single line: '3327362'
Test #42:
score: 0
Accepted
time: 745ms
memory: 4256kb
input:
3000 9 4 1 8 8 8 6 10 8 3 10 4 2 8 10 4 9 3 10 4 1 8 6 3 3 4 3 5 4 1 9 2 6 5 3 5 6 5 2 10 1 10 6 9 9 3 5 9 2 4 9 1 9 4 7 4 1 4 5 1 4 3 10 3 10 9 7 7 7 8 3 3 10 10 5 2 5 9 3 2 4 9 3 1 7 6 6 10 7 5 4 9 8 9 3 10 6 5 6 7 7 3 4 7 3 3 1 6 2 7 4 1 6 10 4 9 5 5 9 1 1 2 1 10 4 4 5 6 6 3 9 3 8 5 10 6 2 2 7 5 ...
output:
3923978
result:
ok single line: '3923978'
Test #43:
score: 0
Accepted
time: 590ms
memory: 4168kb
input:
3000 819 372 497 415 334 981 419 328 220 437 701 858 694 874 527 446 983 554 660 400 833 912 537 245 255 260 277 861 260 526 841 349 682 12 722 193 404 701 341 416 512 156 130 712 551 264 724 532 888 227 1000 579 92 514 612 851 66 509 546 829 110 696 564 875 366 825 522 975 134 891 579 518 420 58 84...
output:
-1
result:
ok single line: '-1'
Test #44:
score: 0
Accepted
time: 605ms
memory: 4364kb
input:
3000 39 51 14 2 62 32 10 73 21 14 44 5 27 44 54 95 67 69 98 69 48 29 55 86 62 13 49 43 91 75 82 9 58 64 45 48 74 77 3 66 54 28 57 72 67 72 81 8 3 82 8 64 21 78 67 42 77 73 49 29 62 59 60 70 36 80 19 66 3 95 56 19 85 11 38 29 11 34 69 71 31 27 93 31 96 47 71 90 2 93 57 15 44 14 37 70 28 95 77 92 33 3...
output:
-1
result:
ok single line: '-1'
Test #45:
score: -100
Time Limit Exceeded
input:
3000 2 1 2 1 2 2 2 2 1 2 1 2 2 2 2 2 2 1 2 1 2 2 1 2 1 1 1 2 1 2 2 2 2 2 1 2 2 1 1 1 2 2 1 1 1 2 2 2 2 1 2 2 2 2 2 1 1 1 2 1 2 1 2 1 1 1 2 2 1 2 2 2 2 2 2 1 2 1 1 1 2 1 2 1 1 1 2 1 1 2 1 2 1 1 1 1 2 1 2 1 1 2 1 2 1 1 1 2 1 2 1 1 2 2 2 2 1 2 2 1 1 1 2 2 1 2 1 2 1 2 1 2 1 2 2 2 1 2 2 1 1 2 2 2 2 1 2 2...