| Task: | Thin Ice |
| Sender: | Gustav Bille Gørtz |
| Submission time: | 2024-04-14 16:14:04 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | WRONG ANSWER | 0 |
| #4 | WRONG ANSWER | 0 |
| #5 | WRONG ANSWER | 0 |
| #6 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.01 s | 1, 5, 6 | details |
| #2 | WRONG ANSWER | 0.01 s | 1, 5, 6 | details |
| #3 | ACCEPTED | 0.01 s | 1, 5, 6 | details |
| #4 | ACCEPTED | 0.01 s | 1, 5, 6 | details |
| #5 | WRONG ANSWER | 0.01 s | 1, 5, 6 | details |
| #6 | ACCEPTED | 0.01 s | 1, 5, 6 | details |
| #7 | ACCEPTED | 0.01 s | 1, 5, 6 | details |
| #8 | WRONG ANSWER | 0.01 s | 1, 5, 6 | details |
| #9 | ACCEPTED | 0.01 s | 1, 2, 5, 6 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 2, 6 | details |
| #11 | WRONG ANSWER | 0.62 s | 2, 6 | details |
| #12 | ACCEPTED | 0.90 s | 2, 6 | details |
| #13 | WRONG ANSWER | 0.47 s | 2, 6 | details |
| #14 | ACCEPTED | 0.50 s | 2, 6 | details |
| #15 | WRONG ANSWER | 0.58 s | 2, 6 | details |
| #16 | WRONG ANSWER | 0.57 s | 2, 6 | details |
| #17 | WRONG ANSWER | 0.79 s | 2, 6 | details |
| #18 | ACCEPTED | 0.79 s | 2, 6 | details |
| #19 | ACCEPTED | 0.38 s | 2, 6 | details |
| #20 | ACCEPTED | 0.56 s | 2, 6 | details |
| #21 | ACCEPTED | 0.13 s | 2, 6 | details |
| #22 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
| #23 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
| #24 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
| #25 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details |
| #26 | ACCEPTED | 0.01 s | 3, 4, 5, 6 | details |
| #27 | WRONG ANSWER | 0.01 s | 3, 4, 5, 6 | details |
| #28 | TIME LIMIT EXCEEDED | -- | 4, 6 | details |
| #29 | TIME LIMIT EXCEEDED | -- | 4, 6 | details |
| #30 | TIME LIMIT EXCEEDED | -- | 4, 6 | details |
| #31 | TIME LIMIT EXCEEDED | -- | 4, 6 | details |
| #32 | ACCEPTED | 0.16 s | 4, 6 | details |
| #33 | TIME LIMIT EXCEEDED | -- | 4, 6 | details |
| #34 | TIME LIMIT EXCEEDED | -- | 4, 6 | details |
| #35 | WRONG ANSWER | 0.02 s | 5, 6 | details |
| #36 | WRONG ANSWER | 0.03 s | 5, 6 | details |
| #37 | WRONG ANSWER | 0.02 s | 5, 6 | details |
| #38 | WRONG ANSWER | 0.02 s | 5, 6 | details |
| #39 | ACCEPTED | 0.01 s | 5, 6 | details |
| #40 | WRONG ANSWER | 0.03 s | 5, 6 | details |
| #41 | WRONG ANSWER | 0.03 s | 5, 6 | details |
| #42 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #43 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #44 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #45 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #46 | ACCEPTED | 0.18 s | 6 | details |
| #47 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #48 | TIME LIMIT EXCEEDED | -- | 6 | details |
Compiler report
input/code.cpp: In function 'int oinkoink(int, int)':
input/code.cpp:71:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
71 | for (int i = 0; i < Ch[p].size(); i++) {
| ~~^~~~~~~~~~~~~~Code
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<set>
#include<numeric>
using namespace std;
#define vi vector<int>
#define pi pair<int, int>
#define vp vector<pi>
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define rall(x) rbegin(x), rend(x)
#define ss set<int>
int n, m;
int ind(int x, int y) {
return y*n+x;
}
struct point {
int d, x, y, idx;
};
struct UF {
vi P, Sz, Con;
vvi C;
ss up;
UF (int a) {
P.resize(a);
iota(all(P), 0);
Sz.resize(a, 1);
Con.resize(a, 0);
C.resize(a);
}
int find(int a) {
return P[a] == a ? a : P[a] = find(P[a]);
}
void uunion(int a, int b) {
a = find(a); b = find(b);
//cerr << "union : find(a) : " << a << " ; find(b) : " << b << endl;
if (a == b) return;
if (Sz[a] < Sz[b]) swap(a, b);
if (C[a].size() < C[b].size()) swap(a, b);
Sz[a] += Sz[b];
for (auto i : C[b]) C[a].push_back(i);
up.insert(a);
P[b] = a;
Con[a] |= Con[b];
}
};
bool comp(point a, point b) {
return a.d > b.d;
}
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};
vi V, Co, S;
vvi Ch;
int oinkoink(int p, int t) {
cerr << "p start : " << p << endl;
if (!Co[p]) return 0;
int a = min(V[p], t + S[p]);
for (int i = 0; i < Ch[p].size(); i++) {
//cerr << i << endl;
a = max(a, oinkoink(Ch[p][i], t + S[p] - S[Ch[p][i]]));
}
cerr << "end : p :" << p << " ; t : " << t << " ; a :" << a << endl;
return a;
}
int oink() {
vvi D(n, vi(m));
vector<point> L(n*m);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int d; cin >> d;
L[ind(i, j)] = {d, i, j, ind(i, j)};
//cerr << ind(i, j) << endl;
D[i][j] = d;
}
}
//cerr << "oink" << endl;
sort(all(L), comp);
int i = 0;
int p = 0;
UF uf(n*m);
for (int i = 0 ; i < n; i ++) {
uf.Con[ind(i, 0)] = 1;
uf.Con[ind(i, m-1)] = 1;
}
for (int i = 0; i < m; i++) {
uf.Con[ind(0, i)] = 1;
uf.Con[ind(n-1, i)] = 1;
}
V.resize(n*m*2);
Co.resize(n*m*2);
S.resize(n*m*2);
Ch.resize(n*m*2, {});
for (int d = 2e5; d > 0; d--) {
//cerr << "d : " << d << endl;
int j = i;
while (j < n*m && L[j].d == d) {
for (int k = 0; k < 4; k++) {
int x = L[j].x + dx[k];
int y = L[j].y + dy[k];
if (x < 0 || x >= n || y < 0 || y >= m || D[x][y] < d) continue;
//cerr << "x,y : " << x << "," << y << endl;
uf.uunion(ind(x, y), L[j].idx);
}
/*
cerr << j << endl;
for (int i = 0; i < n*m; i++) {
cerr << uf.find(i) << " ";
}
cerr << endl;
//*/
j++;
//cerr << j << endl;
}
j = i;
while (j < n*m && L[j].d == d) {
uf.up.insert(L[j].idx);
j++;
}
//cerr << "oink" << endl;
i = j;
for (auto u : uf.up) {
if (uf.find(u) != u) continue;
//cerr << p << endl;
//cerr << d << " " << uf.Con[u] << " " << uf.Sz[u] << " " << endl;
/*
for (auto print : uf.C[u]) {
cerr << print << endl;
}
//*/
//cerr << p << endl;
V[p] = d;
Co[p] = uf.Con[u];
S[p] = uf.Sz[u];
Ch[p] = uf.C[u];
uf.C[u] = {p};
p++;
}
uf.up.clear();
}
//cerr << "oink" << endl;
//*
cerr << endl;
for (int p1 = 0; p1 < p; p1++) {
cerr << p1 << " : " << V[p1] << " " << Co[p1] << " " << S[p1] << endl;
}
//*/
return oinkoink(p-1, 0);
}
int main() {
ios::sync_with_stdio(); cin.tie();
cin >> n >> m;
cout << oink() << "\n";
}Test details
Test 1
Group: 1, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 4 4 9 11 5 7 7 9 14 3 1 3 2 3 11 4 14 8 |
| correct output |
|---|
| 10 |
| user output |
|---|
| 14 |
Error:
0 : 14 0 1 1 : 14 1 1 2 : 11 1 1 3 : 11 1 1 4 : 9 1 4 5 : 8 1 2 6 : 7 1 5 7 : 7 1 1 8 : 5...
Test 2
Group: 1, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 5 3 10 7 11 8 5 5 12 9 10 3 13 9 ... |
| correct output |
|---|
| 10 |
| user output |
|---|
| 12 |
Error:
0 : 13 0 1 1 : 12 1 1 2 : 11 1 1 3 : 10 1 1 4 : 10 1 1 5 : 9 1 5 6 : 8 1 7 7 : 7 1 9 8 :...
Test 3
Group: 1, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 4 4 3 2 2 2 5 1 1 1 8 4 1 1 7 6 2 1 |
| correct output |
|---|
| 8 |
| user output |
|---|
| 8 |
Error:
0 : 8 1 1 1 : 7 1 2 2 : 6 1 3 3 : 5 1 4 4 : 4 1 5 5 : 3 1 6 6 : 2 1 10 7 : 1 1 16 p start...
Test 4
Group: 1, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 3 5 1 11 1 3 5 4 12 7 8 7 13 14 14 9 4 |
| correct output |
|---|
| 14 |
| user output |
|---|
| 14 |
Error:
0 : 14 1 2 1 : 13 1 3 2 : 12 1 4 3 : 11 1 5 4 : 9 1 6 5 : 8 1 7 6 : 7 1 9 7 : 5 1 10 8 :...
Test 5
Group: 1, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 5 3 11 8 12 11 11 12 6 2 3 11 8 13 ... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 13 |
Error:
0 : 13 1 2 1 : 12 1 2 2 : 11 1 1 3 : 11 1 5 4 : 8 1 6 5 : 8 1 6 6 : 6 1 13 7 : 3 1 14 8 :...
Test 6
Group: 1, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 3 5 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 |
| correct output |
|---|
| 14 |
| user output |
|---|
| 14 |
Error:
0 : 14 1 15 p start : 0 end : p :0 ; t : 0 ; a :14
Test 7
Group: 1, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 4 4 12 8 6 5 12 9 6 1 10 1 3 2 8 1 1 1 |
| correct output |
|---|
| 12 |
| user output |
|---|
| 12 |
Error:
0 : 12 1 2 1 : 10 1 3 2 : 9 1 4 3 : 8 1 6 4 : 6 1 8 5 : 5 1 9 6 : 3 1 10 7 : 2 1 11 8 : 1...
Test 8
Group: 1, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 4 4 8 3 15 14 10 12 2 4 5 16 9 6 7 13 1 11 |
| correct output |
|---|
| 13 |
| user output |
|---|
| 15 |
Error:
0 : 16 0 1 1 : 15 1 1 2 : 14 1 2 3 : 13 1 2 4 : 12 1 3 5 : 11 1 1 6 : 10 1 4 7 : 9 1 5 8...
Test 9
Group: 1, 2, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 4 4 4 1 1 2 3 5 4 2 2 2 1 2 1 4 3 4 |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Error:
0 : 5 0 1 1 : 4 1 1 2 : 4 0 2 3 : 4 1 1 4 : 4 1 1 5 : 3 1 4 6 : 3 1 3 7 : 2 1 12 8 : 1 1...
Test 10
Group: 2, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 20000 5 3 2 1 3 2 3 3 4 5 1 1 2 3 5 ... |
| correct output |
|---|
| 5 |
| user output |
|---|
| (empty) |
Test 11
Group: 2, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 20000 1 2 1 2 1 2 1 2 1 1 1 1 2 1 1 ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 4 |
Error:
0 : 4 1 1 1 : 4 1 1 2 : 4 0 1 3 : 4 1 1 4 : 4 0 1 5 : 4 0 1 6 : 4 1 1 7 : 4 0 1 8 : 4 0 1...
Test 12
Group: 2, 6
Verdict: ACCEPTED
| input |
|---|
| 10 20000 3 2 2 3 1 2 1 4 4 3 1 4 3 2 4 ... |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Error:
0 : 5 0 1 1 : 5 0 2 2 : 5 0 1 3 : 5 0 1 4 : 5 1 1 5 : 5 0 1 6 : 5 0 1 7 : 5 1 1 8 : 5 0 2...
Test 13
Group: 2, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20000 10 1 1 3 1 2 1 1 1 1 1 1 2 2 1 1 1 1 2 1 1 2 1 1 1 2 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 5 |
Error:
0 : 5 1 1 1 : 5 1 1 2 : 5 1 1 3 : 5 1 1 4 : 4 1 1 5 : 4 1 1 6 : 4 1 1 7 : 4 1 1 8 : 4 1 1...
Test 14
Group: 2, 6
Verdict: ACCEPTED
| input |
|---|
| 10 20000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Error:
0 : 5 0 1 1 : 5 0 1 2 : 5 0 1 3 : 5 0 1 4 : 5 0 1 5 : 5 0 1 6 : 5 0 1 7 : 5 0 1 8 : 5 0 1...
Test 15
Group: 2, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 20000 3 1 3 1 2 1 2 3 2 2 1 2 1 1 2 ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 5 |
Error:
0 : 5 0 1 1 : 5 0 1 2 : 5 0 1 3 : 5 0 1 4 : 5 0 1 5 : 5 0 1 6 : 5 0 1 7 : 5 0 1 8 : 5 0 1...
Test 16
Group: 2, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 20000 1 2 2 2 1 2 3 1 2 2 2 1 2 2 2 ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 5 |
Error:
0 : 5 0 1 1 : 5 0 1 2 : 5 0 1 3 : 5 0 1 4 : 5 0 1 5 : 5 0 1 6 : 5 0 1 7 : 5 0 1 8 : 5 0 1...
Test 17
Group: 2, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 20000 3 3 2 3 2 3 2 2 2 2 2 1 3 2 1 ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 5 |
Error:
0 : 5 0 1 1 : 5 0 1 2 : 5 0 1 3 : 5 0 1 4 : 5 0 1 5 : 5 1 1 6 : 5 0 1 7 : 5 1 1 8 : 5 0 1...
Test 18
Group: 2, 6
Verdict: ACCEPTED
| input |
|---|
| 10 20000 1 3 3 1 1 4 3 3 3 1 2 2 1 3 1 ... |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Error:
0 : 5 1 1 1 : 5 1 1 2 : 5 1 1 3 : 5 0 1 4 : 5 0 1 5 : 5 0 1 6 : 5 0 1 7 : 5 0 1 8 : 5 0 1...
Test 19
Group: 2, 6
Verdict: ACCEPTED
| input |
|---|
| 7 28571 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Error:
0 : 5 0 1 1 : 5 0 3 2 : 5 0 2 3 : 5 0 3 4 : 5 0 1 5 : 5 0 1 6 : 5 0 3 7 : 5 0 1 8 : 5 0 3...
Test 20
Group: 2, 6
Verdict: ACCEPTED
| input |
|---|
| 28571 7 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 ... |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Error:
0 : 5 1 1 1 : 5 1 1 2 : 5 1 1 3 : 5 1 1 4 : 5 1 1 5 : 5 1 1 6 : 5 1 1 7 : 5 1 1 8 : 5 1 1...
Test 21
Group: 2, 6
Verdict: ACCEPTED
| input |
|---|
| 447 447 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Error:
0 : 3 1 199809 p start : 0 end : p :0 ; t : 0 ; a :3
Test 22
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 1 100 46 23 23 55 37 17 30 32 25 71 ... |
| correct output |
|---|
| 30 |
| user output |
|---|
| 100 |
Error:
0 : 100 1 1 1 : 98 1 1 2 : 95 1 1 3 : 91 1 1 4 : 90 1 1 5 : 87 1 1 6 : 86 1 2 7 : 84 1 1...
Test 23
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 1 100 8 13 12 11 15 15 15 19 18 21 2... |
| correct output |
|---|
| 76 |
| user output |
|---|
| 79 |
Error:
0 : 79 1 1 1 : 78 1 1 2 : 77 1 1 3 : 77 1 2 4 : 76 1 1 5 : 75 1 3 6 : 74 1 4 7 : 73 1 6 8...
Test 24
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 1 100 94 94 94 95 95 91 97 100 92 98... |
| correct output |
|---|
| 95 |
| user output |
|---|
| 100 |
Error:
0 : 100 1 1 1 : 99 1 1 2 : 98 1 2 3 : 98 1 1 4 : 98 1 2 5 : 97 1 2 6 : 97 1 2 7 : 97 1 1...
Test 25
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1 100 83 83 83 83 83 83 83 83 83 83 ... |
| correct output |
|---|
| 83 |
| user output |
|---|
| 83 |
Error:
0 : 83 1 100 p start : 0 end : p :0 ; t : 0 ; a :83
Test 26
Group: 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1 100 33 34 35 38 38 40 41 42 42 45 ... |
| correct output |
|---|
| 95 |
| user output |
|---|
| 95 |
Error:
0 : 95 1 1 1 : 94 1 2 2 : 93 1 3 3 : 92 1 5 4 : 92 1 1 5 : 90 1 7 6 : 88 1 8 7 : 87 1 9 8...
Test 27
Group: 3, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 1 100 57 1 80 39 18 63 30 86 85 55 8... |
| correct output |
|---|
| 29 |
| user output |
|---|
| 100 |
Error:
0 : 100 1 1 1 : 99 1 1 2 : 98 1 1 3 : 97 1 1 4 : 96 1 1 5 : 95 1 1 6 : 94 1 1 7 : 93 1 1...
Test 28
Group: 4, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 200000 138736 14949 12344 104147 1333... |
| correct output |
|---|
| 1806 |
| user output |
|---|
| (empty) |
Test 29
Group: 4, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 200000 141245 141090 141163 141286 14... |
| correct output |
|---|
| 155109 |
| user output |
|---|
| (empty) |
Test 30
Group: 4, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 200000 102358 102469 102440 102402 10... |
| correct output |
|---|
| 152388 |
| user output |
|---|
| (empty) |
Test 31
Group: 4, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 200000 180410 160820 160820 180614 18... |
| correct output |
|---|
| 160832 |
| user output |
|---|
| (empty) |
Test 32
Group: 4, 6
Verdict: ACCEPTED
| input |
|---|
| 1 200000 198270 198270 198270 198270 19... |
| correct output |
|---|
| 198270 |
| user output |
|---|
| 198270 |
Error:
0 : 198270 1 200000 p start : 0 end : p :0 ; t : 0 ; a :198270
Test 33
Group: 4, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 200000 1 1 3 2 1 1 2 3 6 6 6 7 8 9 10... |
| correct output |
|---|
| 199995 |
| user output |
|---|
| (empty) |
Test 34
Group: 4, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1 200000 14737 162555 44228 170991 1340... |
| correct output |
|---|
| 1902 |
| user output |
|---|
| (empty) |
Test 35
Group: 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 31 32 669 792 226 189 860 737 291 83... |
| correct output |
|---|
| 565 |
| user output |
|---|
| 987 |
Error:
0 : 1000 0 1 1 : 999 0 1 2 : 998 0 1 3 : 996 0 1 4 : 996 0 1 5 : 995 0 1 6 : 993 0 1 7 :...
Test 36
Group: 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 100 730 698 339 743 536 702 94 556... |
| correct output |
|---|
| 529 |
| user output |
|---|
| 995 |
Error:
0 : 1000 0 1 1 : 998 0 1 2 : 995 1 2 3 : 995 0 1 4 : 995 0 1 5 : 994 1 1 6 : 992 0 1 7 :...
Test 37
Group: 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 32 31 633 613 618 605 635 638 668 67... |
| correct output |
|---|
| 678 |
| user output |
|---|
| 684 |
Error:
0 : 688 0 1 1 : 685 0 1 2 : 684 1 2 3 : 682 1 4 4 : 678 0 1 5 : 678 1 5 6 : 677 1 6 7 : 6...
Test 38
Group: 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 142 7 983 930 963 926 979 962 962 966 930 963 924 928 928 926 926 929 929 922 931 931 978 929 929 929 922 959 928 964 ... |
| correct output |
|---|
| 934 |
| user output |
|---|
| 994 |
Error:
0 : 995 0 1 1 : 995 1 1 2 : 993 0 1 3 : 993 0 1 4 : 993 1 3 5 : 992 0 1 6 : 992 0 1 7 : 9...
Test 39
Group: 5, 6
Verdict: ACCEPTED
| input |
|---|
| 31 32 977 977 977 977 977 977 977 97... |
| correct output |
|---|
| 977 |
| user output |
|---|
| 977 |
Error:
0 : 977 1 992 p start : 0 end : p :0 ; t : 0 ; a :977
Test 40
Group: 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 50 20 1 27 14 23 38 48 56 3 12 9 6 2... |
| correct output |
|---|
| 997 |
| user output |
|---|
| 998 |
Error:
0 : 998 1 1 1 : 997 1 2 2 : 996 1 3 3 : 995 1 4 4 : 993 1 6 5 : 991 1 7 6 : 990 1 9 7 : 9...
Test 41
Group: 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 20 50 481 532 624 290 965 58 448 872... |
| correct output |
|---|
| 504 |
| user output |
|---|
| 995 |
Error:
0 : 1000 0 1 1 : 999 0 1 2 : 998 0 1 3 : 997 0 1 4 : 996 0 1 5 : 995 1 1 6 : 994 0 1 7 :...
Test 42
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 447 447 6474 27185 108482 124481 16058... |
| correct output |
|---|
| 88202 |
| user output |
|---|
| (empty) |
Test 43
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 200 27722 57131 197677 184858 9285... |
| correct output |
|---|
| 89324 |
| user output |
|---|
| (empty) |
Test 44
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 447 447 70928 73154 72640 74764 75237 ... |
| correct output |
|---|
| 181096 |
| user output |
|---|
| (empty) |
Test 45
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 7 28571 193031 185883 171670 185794 17... |
| correct output |
|---|
| 171680 |
| user output |
|---|
| (empty) |
Test 46
Group: 6
Verdict: ACCEPTED
| input |
|---|
| 10 20000 191628 191628 191628 191628 19... |
| correct output |
|---|
| 191628 |
| user output |
|---|
| 191628 |
Error:
0 : 191628 1 200000 p start : 0 end : p :0 ; t : 0 ; a :191628
Test 47
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200 1000 3550 2640 3791 4248 4257 4504 ... |
| correct output |
|---|
| 199997 |
| user output |
|---|
| (empty) |
Test 48
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 200 198379 62425 88013 50967 49098... |
| correct output |
|---|
| 89131 |
| user output |
|---|
| (empty) |