oj.uz

답안 #966818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966818 2024-04-20T12:14:32 Z anango Paint By Numbers (IOI16_paint) C++17
100 / 100
 1644 ms 296388 KB 
#include "paint.h"
#include <bits/stdc++.h>
#include <cstdlib>
using namespace std;

vector<int> prefX={0};
vector<int> pref_={0};
int n;
int getX(int l, int r) {
    //get X in the interval inclusive
    return prefX[min(r+1,n)] - prefX[l];
}
int get_(int l, int r) {
    //get _ in the interval inclusive
    return pref_[r+1] - pref_[l];
}
vector<vector<bool>> getdp(string s, vector<int> &prefX, vector<int> &pref_, vector<int> c) {
    int k=c.size();
    vector<vector<bool>> dp(n+2, vector<bool>(k+1));
    dp[0][0] = 1;
    //with the last segment covering i-2 (so can start at i) and having covered j segments already
    for (int j=0; j<=k; j++) {
        for (int i=0; i<n; i++) {
            if (!getX(i,i)) dp[i+1][j] = dp[i+1][j] | dp[i][j];
        }
        if (j==k) {
            break;
        }
        for (int i=0; i<n-c[j]+1; i++) {
            if (!get_(i, i+c[j]-1) && !getX(i+c[j], i+c[j])) dp[i+c[j]+1][j+1] = dp[i+c[j]+1][j+1] | dp[i][j];
        }
    }
    for (int i=0; i<n+2; i++) {
        for (int j=0; j<=k; j++) {
            //cout << dp[i][j] << " ";
        }
        //cout << endl;
    }
    return dp;

}
void update_pref(string s) {
    prefX = vector<int>(n+1,0);
    pref_ = vector<int>(n+1,0);
    for (int i=0; i<n; i++) {
        prefX[i+1] = prefX[i]+(s[i]=='X');
        pref_[i+1] = pref_[i]+(s[i]=='_');
    }
}

string solve_puzzle(string s, vector<int> c) {
    n=s.size();
    update_pref(s);
    vector<vector<bool>> forwarddp = getdp(s,prefX, pref_, c);
    //forwarddp[index][j] = is it possible to get next pos start at index, with j used to the left
    reverse(s.begin(), s.end());
    update_pref(s);
    reverse(c.begin(), c.end());
    //cout << endl;
    vector<vector<bool>> backwarddp = getdp(s,prefX, pref_, c);
    //backward[index][j] = is it possible to get next pos start at n-index-1, with j used to the right
    reverse(s.begin(), s.end());
    update_pref(s);
    reverse(c.begin(), c.end());
    vector<pair<int,int>> goodxint;
    int k=c.size();
    vector<int> answers(n,0); //0 = fail both, 1 = X, 2 = _, 3 = X or _
    for (int j=0; j<=k; j++) {
        for (int start=0; start<n; start++) {
            //consider putting a whitespace in start
            if (getX(start, start)==0 && forwarddp[start+1][j] && backwarddp[n-(start-1)-1][k-j]) {
                answers[start] |= 2;
            }
            if (!(start<n-c[j]+1) || j==k) {
                continue;
            }
            int end = start+c[j]-1;
            //cout << start << " " << end << " " << j << endl;
            //fw[start+1] and bw[end-1]
            if (get_(start,end)==0 && forwarddp[start][j] && backwarddp[n-(end)-1][k-j-1]) {
                goodxint.push_back({start,end}); //everything in these bounds inclusive is good
                ////cout << "adding" << " " << start << " " << end << endl;
            }

        }
    }
    //cout << "ANSWERS1 ";
    for (int i=0; i<n; i++) {
        //cout <<answers[i] << " ";
    }
    //cout << endl;
    vector<pair<int,int>> finalint;
    sort(goodxint.begin(), goodxint.end());
    for (int i=0; i<goodxint.size(); i++) {
        int fi,se;
        fi=goodxint[i].first;
        se=goodxint[i].second;
        if (!finalint.size()) {
            finalint.push_back(goodxint[i]);
        }
        else {
            if (fi>finalint.back().second) {
                finalint.push_back(goodxint[i]);
            }
            else if (se>finalint.back().second) {
                pair<int,int> last=finalint.back();
                finalint.pop_back();
                finalint.push_back({last.first,se});
            }
            
        }
    }
    for (int i=0; i<finalint.size(); i++) {
        for (int j=finalint[i].first; j<=finalint[i].second; j++) {
            answers[j] |= 1;
        }
    }
    //cout << "ANSWERS2 ";
    for (int i=0; i<n; i++) {
        //cout <<answers[i] << " ";
    }
    //cout << endl;
    string fans;
    for (int i=0; i<n; i++) {
        assert(answers[i]!=0);
        if (answers[i]==1) {
            fans.push_back('X');
        }
        else if (answers[i]==2) {
            fans.push_back('_');
        }
        else if (answers[i]==3) {
            fans.push_back('?');
        }
    }

    return fans;
}

Compilation message

paint.cpp: In function 'std::string solve_puzzle(std::string, std::vector<int>)':
paint.cpp:94:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for (int i=0; i<goodxint.size(); i++) {
      |                   ~^~~~~~~~~~~~~~~~
paint.cpp:113:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for (int i=0; i<finalint.size(); i++) {
      |                   ~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1
8 Correct 0 ms 344 KB n = 20, m = 5
9 Correct 0 ms 348 KB n = 18, m = 3
10 Correct 0 ms 348 KB n = 17, m = 2
11 Correct 0 ms 348 KB n = 20, m = 2
12 Correct 0 ms 348 KB n = 17, m = 4
13 Correct 0 ms 348 KB n = 17, m = 6
14 Correct 0 ms 348 KB n = 17, m = 1
15 Correct 0 ms 348 KB n = 17, m = 4
16 Correct 1 ms 600 KB n = 13, m = 3
17 Correct 1 ms 348 KB n = 18, m = 4
18 Correct 0 ms 348 KB n = 20, m = 10
19 Correct 1 ms 348 KB n = 19, m = 10

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1
8 Correct 0 ms 344 KB n = 20, m = 5
9 Correct 0 ms 348 KB n = 18, m = 3
10 Correct 0 ms 348 KB n = 17, m = 2
11 Correct 0 ms 348 KB n = 20, m = 2
12 Correct 0 ms 348 KB n = 17, m = 4
13 Correct 0 ms 348 KB n = 17, m = 6
14 Correct 0 ms 348 KB n = 17, m = 1
15 Correct 0 ms 348 KB n = 17, m = 4
16 Correct 1 ms 600 KB n = 13, m = 3
17 Correct 1 ms 348 KB n = 18, m = 4
18 Correct 0 ms 348 KB n = 20, m = 10
19 Correct 1 ms 348 KB n = 19, m = 10
20 Correct 0 ms 344 KB n = 100, m = 5
21 Correct 0 ms 348 KB n = 90, m = 3
22 Correct 0 ms 348 KB n = 86, m = 2
23 Correct 0 ms 348 KB n = 81, m = 4
24 Correct 0 ms 348 KB n = 89, m = 10
25 Correct 0 ms 348 KB n = 81, m = 23
26 Correct 1 ms 348 KB n = 86, m = 8
27 Correct 1 ms 444 KB n = 53, m = 22
28 Correct 0 ms 348 KB n = 89, m = 35
29 Correct 0 ms 348 KB n = 63, m = 25
30 Correct 0 ms 348 KB n = 100, m = 50
31 Correct 1 ms 348 KB n = 99, m = 50

Subtask #4
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1
8 Correct 0 ms 344 KB n = 20, m = 5
9 Correct 0 ms 348 KB n = 18, m = 3
10 Correct 0 ms 348 KB n = 17, m = 2
11 Correct 0 ms 348 KB n = 20, m = 2
12 Correct 0 ms 348 KB n = 17, m = 4
13 Correct 0 ms 348 KB n = 17, m = 6
14 Correct 0 ms 348 KB n = 17, m = 1
15 Correct 0 ms 348 KB n = 17, m = 4
16 Correct 1 ms 600 KB n = 13, m = 3
17 Correct 1 ms 348 KB n = 18, m = 4
18 Correct 0 ms 348 KB n = 20, m = 10
19 Correct 1 ms 348 KB n = 19, m = 10
20 Correct 0 ms 344 KB n = 100, m = 5
21 Correct 0 ms 348 KB n = 90, m = 3
22 Correct 0 ms 348 KB n = 86, m = 2
23 Correct 0 ms 348 KB n = 81, m = 4
24 Correct 0 ms 348 KB n = 89, m = 10
25 Correct 0 ms 348 KB n = 81, m = 23
26 Correct 1 ms 348 KB n = 86, m = 8
27 Correct 1 ms 444 KB n = 53, m = 22
28 Correct 0 ms 348 KB n = 89, m = 35
29 Correct 0 ms 348 KB n = 63, m = 25
30 Correct 0 ms 348 KB n = 100, m = 50
31 Correct 1 ms 348 KB n = 99, m = 50
32 Correct 0 ms 348 KB n = 13, m = 4
33 Correct 0 ms 348 KB n = 86, m = 2
34 Correct 0 ms 544 KB n = 88, m = 2
35 Correct 0 ms 348 KB n = 86, m = 2
36 Correct 0 ms 348 KB n = 81, m = 6
37 Correct 0 ms 348 KB n = 98, m = 7
38 Correct 1 ms 344 KB n = 92, m = 7
39 Correct 0 ms 348 KB n = 88, m = 21
40 Correct 0 ms 448 KB n = 90, m = 21
41 Correct 0 ms 348 KB n = 98, m = 22

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1
8 Correct 0 ms 344 KB n = 20, m = 5
9 Correct 0 ms 348 KB n = 18, m = 3
10 Correct 0 ms 348 KB n = 17, m = 2
11 Correct 0 ms 348 KB n = 20, m = 2
12 Correct 0 ms 348 KB n = 17, m = 4
13 Correct 0 ms 348 KB n = 17, m = 6
14 Correct 0 ms 348 KB n = 17, m = 1
15 Correct 0 ms 348 KB n = 17, m = 4
16 Correct 1 ms 600 KB n = 13, m = 3
17 Correct 1 ms 348 KB n = 18, m = 4
18 Correct 0 ms 348 KB n = 20, m = 10
19 Correct 1 ms 348 KB n = 19, m = 10
20 Correct 0 ms 344 KB n = 100, m = 5
21 Correct 0 ms 348 KB n = 90, m = 3
22 Correct 0 ms 348 KB n = 86, m = 2
23 Correct 0 ms 348 KB n = 81, m = 4
24 Correct 0 ms 348 KB n = 89, m = 10
25 Correct 0 ms 348 KB n = 81, m = 23
26 Correct 1 ms 348 KB n = 86, m = 8
27 Correct 1 ms 444 KB n = 53, m = 22
28 Correct 0 ms 348 KB n = 89, m = 35
29 Correct 0 ms 348 KB n = 63, m = 25
30 Correct 0 ms 348 KB n = 100, m = 50
31 Correct 1 ms 348 KB n = 99, m = 50
32 Correct 0 ms 348 KB n = 13, m = 4
33 Correct 0 ms 348 KB n = 86, m = 2
34 Correct 0 ms 544 KB n = 88, m = 2
35 Correct 0 ms 348 KB n = 86, m = 2
36 Correct 0 ms 348 KB n = 81, m = 6
37 Correct 0 ms 348 KB n = 98, m = 7
38 Correct 1 ms 344 KB n = 92, m = 7
39 Correct 0 ms 348 KB n = 88, m = 21
40 Correct 0 ms 448 KB n = 90, m = 21
41 Correct 0 ms 348 KB n = 98, m = 22
42 Correct 1 ms 348 KB n = 11, m = 2
43 Correct 1 ms 348 KB n = 11, m = 2
44 Correct 1 ms 344 KB n = 13, m = 3
45 Correct 0 ms 348 KB n = 86, m = 2
46 Correct 1 ms 348 KB n = 81, m = 2
47 Correct 0 ms 348 KB n = 93, m = 2
48 Correct 0 ms 348 KB n = 81, m = 2
49 Correct 1 ms 348 KB n = 86, m = 2
50 Correct 0 ms 444 KB n = 90, m = 2
51 Correct 1 ms 344 KB n = 87, m = 2
52 Correct 0 ms 348 KB n = 97, m = 2
53 Correct 1 ms 600 KB n = 85, m = 2
54 Correct 1 ms 344 KB n = 88, m = 7
55 Correct 0 ms 344 KB n = 96, m = 7
56 Correct 0 ms 348 KB n = 85, m = 7
57 Correct 1 ms 348 KB n = 92, m = 7
58 Correct 1 ms 348 KB n = 92, m = 7
59 Correct 0 ms 348 KB n = 86, m = 7
60 Correct 0 ms 348 KB n = 87, m = 7
61 Correct 0 ms 348 KB n = 100, m = 7
62 Correct 0 ms 348 KB n = 100, m = 7
63 Correct 0 ms 348 KB n = 92, m = 21
64 Correct 0 ms 348 KB n = 93, m = 22
65 Correct 0 ms 348 KB n = 95, m = 22
66 Correct 1 ms 348 KB n = 98, m = 22
67 Correct 0 ms 348 KB n = 94, m = 22
68 Correct 0 ms 348 KB n = 93, m = 22
69 Correct 1 ms 348 KB n = 88, m = 21
70 Correct 0 ms 416 KB n = 83, m = 20
71 Correct 0 ms 348 KB n = 99, m = 23
72 Correct 1 ms 348 KB n = 96, m = 19

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1
8 Correct 0 ms 344 KB n = 20, m = 5
9 Correct 0 ms 348 KB n = 18, m = 3
10 Correct 0 ms 348 KB n = 17, m = 2
11 Correct 0 ms 348 KB n = 20, m = 2
12 Correct 0 ms 348 KB n = 17, m = 4
13 Correct 0 ms 348 KB n = 17, m = 6
14 Correct 0 ms 348 KB n = 17, m = 1
15 Correct 0 ms 348 KB n = 17, m = 4
16 Correct 1 ms 600 KB n = 13, m = 3
17 Correct 1 ms 348 KB n = 18, m = 4
18 Correct 0 ms 348 KB n = 20, m = 10
19 Correct 1 ms 348 KB n = 19, m = 10
20 Correct 0 ms 344 KB n = 100, m = 5
21 Correct 0 ms 348 KB n = 90, m = 3
22 Correct 0 ms 348 KB n = 86, m = 2
23 Correct 0 ms 348 KB n = 81, m = 4
24 Correct 0 ms 348 KB n = 89, m = 10
25 Correct 0 ms 348 KB n = 81, m = 23
26 Correct 1 ms 348 KB n = 86, m = 8
27 Correct 1 ms 444 KB n = 53, m = 22
28 Correct 0 ms 348 KB n = 89, m = 35
29 Correct 0 ms 348 KB n = 63, m = 25
30 Correct 0 ms 348 KB n = 100, m = 50
31 Correct 1 ms 348 KB n = 99, m = 50
32 Correct 0 ms 348 KB n = 13, m = 4
33 Correct 0 ms 348 KB n = 86, m = 2
34 Correct 0 ms 544 KB n = 88, m = 2
35 Correct 0 ms 348 KB n = 86, m = 2
36 Correct 0 ms 348 KB n = 81, m = 6
37 Correct 0 ms 348 KB n = 98, m = 7
38 Correct 1 ms 344 KB n = 92, m = 7
39 Correct 0 ms 348 KB n = 88, m = 21
40 Correct 0 ms 448 KB n = 90, m = 21
41 Correct 0 ms 348 KB n = 98, m = 22
42 Correct 1 ms 348 KB n = 11, m = 2
43 Correct 1 ms 348 KB n = 11, m = 2
44 Correct 1 ms 344 KB n = 13, m = 3
45 Correct 0 ms 348 KB n = 86, m = 2
46 Correct 1 ms 348 KB n = 81, m = 2
47 Correct 0 ms 348 KB n = 93, m = 2
48 Correct 0 ms 348 KB n = 81, m = 2
49 Correct 1 ms 348 KB n = 86, m = 2
50 Correct 0 ms 444 KB n = 90, m = 2
51 Correct 1 ms 344 KB n = 87, m = 2
52 Correct 0 ms 348 KB n = 97, m = 2
53 Correct 1 ms 600 KB n = 85, m = 2
54 Correct 1 ms 344 KB n = 88, m = 7
55 Correct 0 ms 344 KB n = 96, m = 7
56 Correct 0 ms 348 KB n = 85, m = 7
57 Correct 1 ms 348 KB n = 92, m = 7
58 Correct 1 ms 348 KB n = 92, m = 7
59 Correct 0 ms 348 KB n = 86, m = 7
60 Correct 0 ms 348 KB n = 87, m = 7
61 Correct 0 ms 348 KB n = 100, m = 7
62 Correct 0 ms 348 KB n = 100, m = 7
63 Correct 0 ms 348 KB n = 92, m = 21
64 Correct 0 ms 348 KB n = 93, m = 22
65 Correct 0 ms 348 KB n = 95, m = 22
66 Correct 1 ms 348 KB n = 98, m = 22
67 Correct 0 ms 348 KB n = 94, m = 22
68 Correct 0 ms 348 KB n = 93, m = 22
69 Correct 1 ms 348 KB n = 88, m = 21
70 Correct 0 ms 416 KB n = 83, m = 20
71 Correct 0 ms 348 KB n = 99, m = 23
72 Correct 1 ms 348 KB n = 96, m = 19
73 Correct 2 ms 1116 KB n = 4825, m = 5
74 Correct 2 ms 1120 KB n = 4384, m = 5
75 Correct 1 ms 1112 KB n = 4528, m = 5
76 Correct 2 ms 1196 KB n = 4980, m = 5
77 Correct 1 ms 1112 KB n = 4730, m = 5
78 Correct 1 ms 1116 KB n = 4784, m = 5
79 Correct 2 ms 1112 KB n = 4875, m = 5
80 Correct 1 ms 1116 KB n = 4576, m = 5
81 Correct 1 ms 1116 KB n = 4297, m = 5
82 Correct 4 ms 1120 KB n = 4662, m = 48
83 Correct 4 ms 1188 KB n = 4753, m = 49
84 Correct 4 ms 1116 KB n = 4148, m = 46
85 Correct 4 ms 1112 KB n = 4906, m = 50
86 Correct 5 ms 1116 KB n = 4967, m = 50
87 Correct 5 ms 1208 KB n = 4828, m = 49
88 Correct 4 ms 1116 KB n = 4105, m = 45
89 Correct 5 ms 1116 KB n = 4954, m = 50
90 Correct 7 ms 1500 KB n = 4884, m = 49
91 Correct 8 ms 1372 KB n = 4307, m = 100
92 Correct 8 ms 1116 KB n = 4668, m = 100
93 Correct 8 ms 1172 KB n = 4647, m = 100
94 Correct 9 ms 1116 KB n = 4372, m = 100
95 Correct 8 ms 1116 KB n = 4791, m = 100
96 Correct 8 ms 1116 KB n = 4029, m = 100
97 Correct 7 ms 956 KB n = 4439, m = 100
98 Correct 8 ms 1112 KB n = 4018, m = 100
99 Correct 15 ms 2268 KB n = 4979, m = 100
100 Correct 8 ms 1116 KB n = 4996, m = 89

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n = 13, m = 1
2 Correct 0 ms 348 KB n = 18, m = 1
3 Correct 0 ms 348 KB n = 17, m = 1
4 Correct 1 ms 348 KB n = 1, m = 1
5 Correct 0 ms 344 KB n = 20, m = 1
6 Correct 0 ms 348 KB n = 20, m = 1
7 Correct 0 ms 348 KB n = 20, m = 1
8 Correct 0 ms 344 KB n = 20, m = 5
9 Correct 0 ms 348 KB n = 18, m = 3
10 Correct 0 ms 348 KB n = 17, m = 2
11 Correct 0 ms 348 KB n = 20, m = 2
12 Correct 0 ms 348 KB n = 17, m = 4
13 Correct 0 ms 348 KB n = 17, m = 6
14 Correct 0 ms 348 KB n = 17, m = 1
15 Correct 0 ms 348 KB n = 17, m = 4
16 Correct 1 ms 600 KB n = 13, m = 3
17 Correct 1 ms 348 KB n = 18, m = 4
18 Correct 0 ms 348 KB n = 20, m = 10
19 Correct 1 ms 348 KB n = 19, m = 10
20 Correct 0 ms 344 KB n = 100, m = 5
21 Correct 0 ms 348 KB n = 90, m = 3
22 Correct 0 ms 348 KB n = 86, m = 2
23 Correct 0 ms 348 KB n = 81, m = 4
24 Correct 0 ms 348 KB n = 89, m = 10
25 Correct 0 ms 348 KB n = 81, m = 23
26 Correct 1 ms 348 KB n = 86, m = 8
27 Correct 1 ms 444 KB n = 53, m = 22
28 Correct 0 ms 348 KB n = 89, m = 35
29 Correct 0 ms 348 KB n = 63, m = 25
30 Correct 0 ms 348 KB n = 100, m = 50
31 Correct 1 ms 348 KB n = 99, m = 50
32 Correct 0 ms 348 KB n = 13, m = 4
33 Correct 0 ms 348 KB n = 86, m = 2
34 Correct 0 ms 544 KB n = 88, m = 2
35 Correct 0 ms 348 KB n = 86, m = 2
36 Correct 0 ms 348 KB n = 81, m = 6
37 Correct 0 ms 348 KB n = 98, m = 7
38 Correct 1 ms 344 KB n = 92, m = 7
39 Correct 0 ms 348 KB n = 88, m = 21
40 Correct 0 ms 448 KB n = 90, m = 21
41 Correct 0 ms 348 KB n = 98, m = 22
42 Correct 1 ms 348 KB n = 11, m = 2
43 Correct 1 ms 348 KB n = 11, m = 2
44 Correct 1 ms 344 KB n = 13, m = 3
45 Correct 0 ms 348 KB n = 86, m = 2
46 Correct 1 ms 348 KB n = 81, m = 2
47 Correct 0 ms 348 KB n = 93, m = 2
48 Correct 0 ms 348 KB n = 81, m = 2
49 Correct 1 ms 348 KB n = 86, m = 2
50 Correct 0 ms 444 KB n = 90, m = 2
51 Correct 1 ms 344 KB n = 87, m = 2
52 Correct 0 ms 348 KB n = 97, m = 2
53 Correct 1 ms 600 KB n = 85, m = 2
54 Correct 1 ms 344 KB n = 88, m = 7
55 Correct 0 ms 344 KB n = 96, m = 7
56 Correct 0 ms 348 KB n = 85, m = 7
57 Correct 1 ms 348 KB n = 92, m = 7
58 Correct 1 ms 348 KB n = 92, m = 7
59 Correct 0 ms 348 KB n = 86, m = 7
60 Correct 0 ms 348 KB n = 87, m = 7
61 Correct 0 ms 348 KB n = 100, m = 7
62 Correct 0 ms 348 KB n = 100, m = 7
63 Correct 0 ms 348 KB n = 92, m = 21
64 Correct 0 ms 348 KB n = 93, m = 22
65 Correct 0 ms 348 KB n = 95, m = 22
66 Correct 1 ms 348 KB n = 98, m = 22
67 Correct 0 ms 348 KB n = 94, m = 22
68 Correct 0 ms 348 KB n = 93, m = 22
69 Correct 1 ms 348 KB n = 88, m = 21
70 Correct 0 ms 416 KB n = 83, m = 20
71 Correct 0 ms 348 KB n = 99, m = 23
72 Correct 1 ms 348 KB n = 96, m = 19
73 Correct 2 ms 1116 KB n = 4825, m = 5
74 Correct 2 ms 1120 KB n = 4384, m = 5
75 Correct 1 ms 1112 KB n = 4528, m = 5
76 Correct 2 ms 1196 KB n = 4980, m = 5
77 Correct 1 ms 1112 KB n = 4730, m = 5
78 Correct 1 ms 1116 KB n = 4784, m = 5
79 Correct 2 ms 1112 KB n = 4875, m = 5
80 Correct 1 ms 1116 KB n = 4576, m = 5
81 Correct 1 ms 1116 KB n = 4297, m = 5
82 Correct 4 ms 1120 KB n = 4662, m = 48
83 Correct 4 ms 1188 KB n = 4753, m = 49
84 Correct 4 ms 1116 KB n = 4148, m = 46
85 Correct 4 ms 1112 KB n = 4906, m = 50
86 Correct 5 ms 1116 KB n = 4967, m = 50
87 Correct 5 ms 1208 KB n = 4828, m = 49
88 Correct 4 ms 1116 KB n = 4105, m = 45
89 Correct 5 ms 1116 KB n = 4954, m = 50
90 Correct 7 ms 1500 KB n = 4884, m = 49
91 Correct 8 ms 1372 KB n = 4307, m = 100
92 Correct 8 ms 1116 KB n = 4668, m = 100
93 Correct 8 ms 1172 KB n = 4647, m = 100
94 Correct 9 ms 1116 KB n = 4372, m = 100
95 Correct 8 ms 1116 KB n = 4791, m = 100
96 Correct 8 ms 1116 KB n = 4029, m = 100
97 Correct 7 ms 956 KB n = 4439, m = 100
98 Correct 8 ms 1112 KB n = 4018, m = 100
99 Correct 15 ms 2268 KB n = 4979, m = 100
100 Correct 8 ms 1116 KB n = 4996, m = 89
101 Correct 62 ms 28888 KB n = 178952, m = 10
102 Correct 64 ms 29012 KB n = 180674, m = 10
103 Correct 56 ms 26880 KB n = 167639, m = 10
104 Correct 52 ms 27836 KB n = 172892, m = 10
105 Correct 51 ms 27120 KB n = 168125, m = 10
106 Correct 51 ms 26924 KB n = 166514, m = 10
107 Correct 54 ms 29484 KB n = 183874, m = 10
108 Correct 58 ms 31388 KB n = 194560, m = 10
109 Correct 48 ms 27584 KB n = 171994, m = 10
110 Correct 333 ms 26732 KB n = 165207, m = 100
111 Correct 361 ms 30396 KB n = 188459, m = 100
112 Correct 306 ms 26356 KB n = 162137, m = 100
113 Correct 264 ms 27364 KB n = 169691, m = 100
114 Correct 316 ms 30256 KB n = 187642, m = 100
115 Correct 263 ms 27168 KB n = 168456, m = 100
116 Correct 265 ms 29084 KB n = 180980, m = 100
117 Correct 304 ms 30784 KB n = 191687, m = 100
118 Correct 248 ms 26888 KB n = 166437, m = 100
119 Correct 356 ms 30076 KB n = 186520, m = 100
120 Correct 328 ms 26820 KB n = 166675, m = 100
121 Correct 382 ms 30272 KB n = 187725, m = 100
122 Correct 231 ms 26148 KB n = 161455, m = 100
123 Correct 302 ms 31156 KB n = 192977, m = 100
124 Correct 310 ms 31096 KB n = 192612, m = 100
125 Correct 300 ms 31636 KB n = 196512, m = 100
126 Correct 351 ms 32052 KB n = 198968, m = 100
127 Correct 248 ms 26876 KB n = 166659, m = 100
128 Correct 187 ms 32404 KB n = 199997, m = 34
129 Correct 32 ms 32092 KB n = 200000, m = 1
130 Correct 41 ms 36956 KB n = 200000, m = 1
131 Correct 1644 ms 296388 KB n = 199999, m = 100
132 Correct 486 ms 32168 KB n = 199999, m = 100
133 Correct 28 ms 32100 KB n = 200000, m = 1