oj.uz

Submission #282871

# Submission time Handle Problem Language Result Execution time Memory
282871 2020-08-25T05:55:47 Z 최은수(#5745) Lock Puzzle (innopolis2018_final_A) C++17
100 / 100
 10 ms 512 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
string s;
vector<int>ov;
inline void oper(int x)
{
    if(x!=(int)s.size())
        ov.eb((int)s.size()-x);
    string s1=s.substr(0,x);
    string s2=s.substr(x,(int)s.size()-x);
    reverse(all(s2));
    s=s2+s1;
    return;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    cin>>n>>m;
    string t;
    cin>>s>>t;
    {
        string s1=s,t1=t;
        sort(all(s1));
        sort(all(t1));
        if(s1!=t1)
            return cout<<-1<<endl,0;
    }
    for(int i=0;i+1<n;i+=2)
    {
        int p1=-1;
        int p2=-1;
        for(int j=n-i-1;j>=0;j--)
        {
            if(s[j]==t[i])
            {
                p1=j;
                break;
            }
        }
        for(int j=n-i-1;j>=0;j--)
        {
            if(j!=p1&&s[j]==t[i+1])
            {
                p2=j;
                break;
            }
        }
        if(p1<p2)
        {
            int s1=p1;
            int s2=p2-p1-1;
            int s3=n-i-1-p2;
            int s4=i;
            oper(s1+1+s2+1);
            oper(s4+s3+s1);
            oper(1+s2);
            oper(s1+s3+s4+1+1);
        }
        else
        {
            int s1=p2;
            int s2=p1-p2-1;
            int s3=n-i-1-p1;
            int s4=i;
            oper(s1+1);
            oper(s4+s3);
            oper(1+s1+s2);
            oper(s3+s4+1+1);
        }
    }
    if(n%2==1)
    {
        oper(0);
        oper(n-1);
        oper(0);
    }
    cout<<ov.size()<<endl;
    for(int&t:ov)
        cout<<t<<' ';
    cout<<endl;
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 96 operations
10 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 96 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 195 operations
12 Correct 1 ms 384 KB [n = 99, m = 10000], OK, 196 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 87 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 96 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 94 operations
17 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 97 operations

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 96 operations
10 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 96 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 195 operations
12 Correct 1 ms 384 KB [n = 99, m = 10000], OK, 196 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 87 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 96 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 94 operations
17 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 97 operations
18 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1985 operations
19 Correct 3 ms 384 KB [n = 999, m = 10000], OK, 1985 operations
20 Correct 3 ms 384 KB [n = 998, m = 10000], OK, 1986 operations
21 Correct 3 ms 384 KB [n = 997, m = 10000], OK, 1987 operations
22 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1783 operations
23 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1966 operations
24 Correct 1 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1947 operations
26 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1995 operations

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 96 operations
10 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 96 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 195 operations
12 Correct 1 ms 384 KB [n = 99, m = 10000], OK, 196 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 87 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 96 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 94 operations
17 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 97 operations
18 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1985 operations
19 Correct 3 ms 384 KB [n = 999, m = 10000], OK, 1985 operations
20 Correct 3 ms 384 KB [n = 998, m = 10000], OK, 1986 operations
21 Correct 3 ms 384 KB [n = 997, m = 10000], OK, 1987 operations
22 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1783 operations
23 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1966 operations
24 Correct 1 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1947 operations
26 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1995 operations
27 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3978 operations
28 Correct 8 ms 384 KB [n = 1999, m = 10000], OK, 3988 operations
29 Correct 8 ms 384 KB [n = 1998, m = 10000], OK, 3984 operations
30 Correct 7 ms 384 KB [n = 1997, m = 10000], OK, 3973 operations
31 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3959 operations
32 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3932 operations
33 Correct 1 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3904 operations
35 Correct 10 ms 384 KB [n = 2000, m = 10000], OK, 3992 operations

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 96 operations
10 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 96 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 195 operations
12 Correct 1 ms 384 KB [n = 99, m = 10000], OK, 196 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 87 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 96 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 94 operations
17 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 97 operations
18 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1985 operations
19 Correct 3 ms 384 KB [n = 999, m = 10000], OK, 1985 operations
20 Correct 3 ms 384 KB [n = 998, m = 10000], OK, 1986 operations
21 Correct 3 ms 384 KB [n = 997, m = 10000], OK, 1987 operations
22 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1783 operations
23 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1966 operations
24 Correct 1 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1947 operations
26 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1995 operations
27 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3978 operations
28 Correct 8 ms 384 KB [n = 1999, m = 10000], OK, 3988 operations
29 Correct 8 ms 384 KB [n = 1998, m = 10000], OK, 3984 operations
30 Correct 7 ms 384 KB [n = 1997, m = 10000], OK, 3973 operations
31 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3959 operations
32 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3932 operations
33 Correct 1 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3904 operations
35 Correct 10 ms 384 KB [n = 2000, m = 10000], OK, 3992 operations
36 Correct 9 ms 384 KB [n = 2000, m = 8100], OK, 3984 operations
37 Correct 8 ms 384 KB [n = 1999, m = 8100], OK, 3984 operations
38 Correct 8 ms 384 KB [n = 1998, m = 8100], OK, 3975 operations
39 Correct 8 ms 384 KB [n = 1997, m = 8100], OK, 3973 operations
40 Correct 7 ms 384 KB [n = 1996, m = 8100], OK, 3980 operations
41 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3959 operations
42 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3929 operations
43 Correct 1 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3916 operations
45 Correct 8 ms 384 KB [n = 2000, m = 8100], OK, 3983 operations

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 96 operations
10 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 96 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 195 operations
12 Correct 1 ms 384 KB [n = 99, m = 10000], OK, 196 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 87 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 96 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 94 operations
17 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 97 operations
18 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1985 operations
19 Correct 3 ms 384 KB [n = 999, m = 10000], OK, 1985 operations
20 Correct 3 ms 384 KB [n = 998, m = 10000], OK, 1986 operations
21 Correct 3 ms 384 KB [n = 997, m = 10000], OK, 1987 operations
22 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1783 operations
23 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1966 operations
24 Correct 1 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1947 operations
26 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1995 operations
27 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3978 operations
28 Correct 8 ms 384 KB [n = 1999, m = 10000], OK, 3988 operations
29 Correct 8 ms 384 KB [n = 1998, m = 10000], OK, 3984 operations
30 Correct 7 ms 384 KB [n = 1997, m = 10000], OK, 3973 operations
31 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3959 operations
32 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3932 operations
33 Correct 1 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3904 operations
35 Correct 10 ms 384 KB [n = 2000, m = 10000], OK, 3992 operations
36 Correct 9 ms 384 KB [n = 2000, m = 8100], OK, 3984 operations
37 Correct 8 ms 384 KB [n = 1999, m = 8100], OK, 3984 operations
38 Correct 8 ms 384 KB [n = 1998, m = 8100], OK, 3975 operations
39 Correct 8 ms 384 KB [n = 1997, m = 8100], OK, 3973 operations
40 Correct 7 ms 384 KB [n = 1996, m = 8100], OK, 3980 operations
41 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3959 operations
42 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3929 operations
43 Correct 1 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3916 operations
45 Correct 8 ms 384 KB [n = 2000, m = 8100], OK, 3983 operations
46 Correct 8 ms 384 KB [n = 2000, m = 6100], OK, 3982 operations
47 Correct 8 ms 384 KB [n = 1999, m = 6100], OK, 3980 operations
48 Correct 9 ms 384 KB [n = 1998, m = 6100], OK, 3973 operations
49 Correct 9 ms 384 KB [n = 1997, m = 6100], OK, 3979 operations
50 Correct 8 ms 384 KB [n = 1996, m = 6100], OK, 3973 operations
51 Correct 8 ms 416 KB [n = 2000, m = 6100], OK, 3959 operations
52 Correct 7 ms 384 KB [n = 2000, m = 6100], OK, 3924 operations
53 Correct 1 ms 384 KB [n = 2000, m = 6100], OK: No solution
54 Correct 7 ms 384 KB [n = 2000, m = 6100], OK, 3906 operations
55 Correct 7 ms 384 KB [n = 2000, m = 6100], OK, 3987 operations

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB [n = 1, m = 10000], OK, 3 operations
2 Correct 1 ms 384 KB [n = 2, m = 10000], OK, 3 operations
3 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
4 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
5 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 15 operations
6 Correct 0 ms 256 KB [n = 8, m = 10000], OK: No solution
7 Correct 1 ms 384 KB [n = 8, m = 10000], OK, 15 operations
8 Correct 0 ms 384 KB [n = 8, m = 10000], OK, 12 operations
9 Correct 1 ms 384 KB [n = 49, m = 10000], OK, 96 operations
10 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 96 operations
11 Correct 1 ms 384 KB [n = 100, m = 10000], OK, 195 operations
12 Correct 1 ms 384 KB [n = 99, m = 10000], OK, 196 operations
13 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 87 operations
14 Correct 1 ms 256 KB [n = 50, m = 10000], OK, 96 operations
15 Correct 0 ms 384 KB [n = 50, m = 10000], OK: No solution
16 Correct 1 ms 384 KB [n = 50, m = 10000], OK, 94 operations
17 Correct 0 ms 384 KB [n = 50, m = 10000], OK, 97 operations
18 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1985 operations
19 Correct 3 ms 384 KB [n = 999, m = 10000], OK, 1985 operations
20 Correct 3 ms 384 KB [n = 998, m = 10000], OK, 1986 operations
21 Correct 3 ms 384 KB [n = 997, m = 10000], OK, 1987 operations
22 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1783 operations
23 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1966 operations
24 Correct 1 ms 384 KB [n = 1000, m = 10000], OK: No solution
25 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1947 operations
26 Correct 3 ms 384 KB [n = 1000, m = 10000], OK, 1995 operations
27 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3978 operations
28 Correct 8 ms 384 KB [n = 1999, m = 10000], OK, 3988 operations
29 Correct 8 ms 384 KB [n = 1998, m = 10000], OK, 3984 operations
30 Correct 7 ms 384 KB [n = 1997, m = 10000], OK, 3973 operations
31 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3959 operations
32 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3932 operations
33 Correct 1 ms 384 KB [n = 2000, m = 10000], OK: No solution
34 Correct 7 ms 384 KB [n = 2000, m = 10000], OK, 3904 operations
35 Correct 10 ms 384 KB [n = 2000, m = 10000], OK, 3992 operations
36 Correct 9 ms 384 KB [n = 2000, m = 8100], OK, 3984 operations
37 Correct 8 ms 384 KB [n = 1999, m = 8100], OK, 3984 operations
38 Correct 8 ms 384 KB [n = 1998, m = 8100], OK, 3975 operations
39 Correct 8 ms 384 KB [n = 1997, m = 8100], OK, 3973 operations
40 Correct 7 ms 384 KB [n = 1996, m = 8100], OK, 3980 operations
41 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3959 operations
42 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3929 operations
43 Correct 1 ms 384 KB [n = 2000, m = 8100], OK: No solution
44 Correct 7 ms 384 KB [n = 2000, m = 8100], OK, 3916 operations
45 Correct 8 ms 384 KB [n = 2000, m = 8100], OK, 3983 operations
46 Correct 8 ms 384 KB [n = 2000, m = 6100], OK, 3982 operations
47 Correct 8 ms 384 KB [n = 1999, m = 6100], OK, 3980 operations
48 Correct 9 ms 384 KB [n = 1998, m = 6100], OK, 3973 operations
49 Correct 9 ms 384 KB [n = 1997, m = 6100], OK, 3979 operations
50 Correct 8 ms 384 KB [n = 1996, m = 6100], OK, 3973 operations
51 Correct 8 ms 416 KB [n = 2000, m = 6100], OK, 3959 operations
52 Correct 7 ms 384 KB [n = 2000, m = 6100], OK, 3924 operations
53 Correct 1 ms 384 KB [n = 2000, m = 6100], OK: No solution
54 Correct 7 ms 384 KB [n = 2000, m = 6100], OK, 3906 operations
55 Correct 7 ms 384 KB [n = 2000, m = 6100], OK, 3987 operations
56 Correct 8 ms 512 KB [n = 2000, m = 5100], OK, 3977 operations
57 Correct 8 ms 384 KB [n = 1999, m = 5100], OK, 3982 operations
58 Correct 8 ms 512 KB [n = 1998, m = 5100], OK, 3979 operations
59 Correct 8 ms 384 KB [n = 1997, m = 5100], OK, 3978 operations
60 Correct 7 ms 384 KB [n = 1996, m = 5100], OK, 3973 operations
61 Correct 8 ms 384 KB [n = 1995, m = 5100], OK, 3975 operations
62 Correct 9 ms 384 KB [n = 1994, m = 5100], OK, 3967 operations
63 Correct 7 ms 384 KB [n = 2000, m = 5100], OK, 3995 operations
64 Correct 7 ms 384 KB [n = 2000, m = 5100], OK, 3959 operations
65 Correct 7 ms 384 KB [n = 2000, m = 5100], OK, 3925 operations
66 Correct 1 ms 384 KB [n = 2000, m = 5100], OK: No solution
67 Correct 7 ms 384 KB [n = 2000, m = 5100], OK, 3885 operations