— Dark mode

Putka Open 2020 – 4/5

Ruudukko

  • Start: 2020-11-06 18:00:00
  • End: 2020-11-08 23:00:00
CSES - Putka Open 2020 – 4/5 - Results
Submission details
Task:Ruudukko
Sender:Mahtimursu
Submission time:2023-03-10 23:52:27 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
#50
Test results
testverdicttimegroup
#10.00 s1, 5details
#20.00 s2, 5details
#30.00 s3, 5details
#40.01 s4, 5details
#50.01 s5details
#60.01 s5details
#70.00 s2, 5details
#80.00 s2, 5details
#90.00 s3, 5details
#100.00 s3, 5details
#110.00 s3, 5details
#120.00 s3, 5details
#130.00 s4, 5details
#140.01 s5details
#150.00 s3, 5details
#160.02 s5details

Code

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007
#define N (1 << 18)

#define y first
#define x second

using namespace std;

map<tuple<int, int, pair<int, int>, pair<int, int>>, int> dp;

// FROM https://cses.fi/342/result/1233306

string solveSmall(int h, int w, int y0, int x0, int y1, int x1) {
	if (x0 > x1 || (x0 == x1 && y0 > y1)) return solveSmall(h, w, y1, x1, y0, x0);
 
	if (h == 1) {
		if (x0 == 0 && x1 == w-1) return "X";
		if (x0 == w-1 && x1 == 0) return "X";
		return "";
	} else {
		if (x0 == x1 && 0 < x0 && x0 < w-1) return "";
 
		/*string res;
		if (x0 == x1 && x0 == 0) {
			for (int i = 0; i < w-1; ++i) res.push_back('R');
 
			if (y0 == 0) res.push_back('U');
			else res.push_back('D');
 
			for (int i = 0; i < w-1; ++i) res.push_back('L');
 
		} else {
			for (int i = 0; i < x0; ++i) res.push_back('L');
 
			if (y0 == 0) res.push_back('U');
			else res.push_back('D');
 
			for (int i = 0; i < x0; ++i) res.push_back('R');
 
			if (x0 == x1) return res;
 
			for (int i = 0; i < x1 - x0 - 1; ++i) {
				res.push_back('R');
				if ((i ^ y0) & 1) res.push_back('U');
				else res.push_back('D');
			}
			res.push_back('R');
 
			for (int i = 0; i < w-1 - x1; ++i) res.push_back('R');
 
			if (y1 == 0) res.push_back('D');
			else res.push_back('U');
 
			for (int i = 0; i < w-1 - x1; ++i) res.push_back('L');
		}*/
		
		return "X";
	}
}

bool inside(int n, int m, pair<int, int> p) {
    return p.x <= m && p.y <= n && p.x > 0 && p.y > 0;
}

bool works(int h, int w, int y0, int x0, int y1, int x1);

bool works(int h, int w, int y0, int x0, int y1, int x1) {
	if (y0 == y1 && x0 == x1) return false;
	if (w < h) return works(w, h, x0, y0, x1, y1);
	if (! ((h*w ^ abs(x0 - x1) ^ abs(y0 - y1)) & 1)) return false;
	if ((h*w & 1) && ((x0 + y0) & 1)) return false;
 
	if (h <= 2) return !solveSmall(h, w, y0, x0, y1, x1).empty();
	if (h == 3 && (!(w & 1))) {
		if (y0 == 1) {
			if ((x0 & 1) && x1 < x0) return false;
			if (!(x0 & 1) && x1 > x0) return false;
		} else {
			if (!(x0 & 1) && (x1 < x0 - 1)) return false;
			if ((x0 & 1) && (x1 > x0 + 1)) return false;
		}
	}   
	return true;
}

bool ok(int h, int w, pair<int, int> s, pair<int, int> t) {
    return works(h, w, s.y - 1, s.x - 1, t.y - 1, t.x - 1);
}

pair<int, int> offset(pair<int, int> p, pair<int, int> off) {
    return {p.y + off.y, p.x + off.x};
}

// END FROM

map<tuple<int, int, pair<int, int>, pair<int, int>>, pair<tuple<int, int, pair<int, int>, pair<int, int>>, tuple<int, int, pair<int, int>, pair<int, int>>>> mp;

int solve(int n, int m, pair<int, int> s, pair<int, int> t) {
    if (n < m) return solve(m, n, {s.x, s.y}, {t.x, t.y});
    if (s > t) return solve(n, m, t, s);
    int best = n * m;
    if (best <= 20) return best;
    if (dp[make_tuple(n, m, s, t)]) return dp[make_tuple(n, m, s, t)];
    //cout << n << " " << m << endl;

    int min_i = min(s.y, t.y);
    int max_i = max(s.y, t.y);

    int min_j = min(s.x, t.x);
    int max_j = max(s.x, t.x);

    // Try stripping

    if (min_i > 2) {
        if (ok(n - 2, m, offset(s, {-2, 0}), offset(t, {-2, 0}))) {
            auto x1 = make_tuple(2, m, make_pair(0,0), make_pair(0,0));
            auto x2 = make_tuple(n - 2, m, offset(s, {-2, 0}), offset(t, {-2, 0}));
            mp[make_tuple(n, m, s, t)] = make_pair(x1, x2);

            return dp[make_tuple(n, m, s, t)] = solve(n - 2, m, offset(s, {-2, 0}), offset(t, {-2, 0}));
        }
            
    }

    if (max_i < n - 1) {
        if (ok(n - 2, m, s, t)) {
            auto x1 = make_tuple(2, m, make_pair(0,0), make_pair(0,0));
            auto x2 = make_tuple(n - 2, m, s, t);
            mp[make_tuple(n, m, s, t)] = make_pair(x1, x2);

            return dp[make_tuple(n, m, s, t)] = solve(n - 2, m, s, t);
        }
            
    }

    if (min_j > 2) {
        if (ok(n, m - 2, offset(s, {0, -2}), offset(t, {0, -2}))) {
            auto x1 = make_tuple(n, 2, make_pair(0,0), make_pair(0,0));
            auto x2 = make_tuple(n, m - 2, offset(s, {0, -2}), offset(t, {0, -2}));
            mp[make_tuple(n, m, s, t)] = make_pair(x1, x2);

            return dp[make_tuple(n, m, s, t)] = solve(n, m - 2, offset(s, {0, -2}), offset(t, {0, -2}));
        }
            
    }

    if (max_j < m - 1) {
        if (ok(n, m - 2, s, t)) {
            auto x1 = make_tuple(n, 2, make_pair(0,0), make_pair(0,0));
            auto x2 = make_tuple(n, m - 2, s, t);
            mp[make_tuple(n, m, s, t)] = make_pair(x1, x2);

            return dp[make_tuple(n, m, s, t)] = solve(n, m - 2, s, t);
        }
            
    }

    max_i = min(max_i, min_i + 2);
    max_j = min(max_j, min_j + 2);


    // Split vertical

    pair<tuple<int, int, pair<int, int>, pair<int, int>>, tuple<int, int, pair<int, int>, pair<int, int>>> ans;
    

    for (int i = min_i; i < max_i; ++i) {
        for (int j = 1; j <= m; ++j) {
            int first_n = i;
            int second_n = n - i;

            pair<int, int> first_e = {first_n, j};
            pair<int, int> second_e = {first_n + 1, j};

            // s -> first_e && second_e -> t

            if (inside(first_n, m, s) 
                && inside(second_n, m, offset(t, {-first_n, 0}))
                && ok(first_n, m, s, first_e) 
                && ok(second_n, m, offset(t, {-first_n, 0}), offset(second_e, {-first_n, 0}))
            ) {
                int cur = solve(first_n, m, s, first_e);
                if (cur < best) cur = max(cur, solve(second_n, m, offset(t, {-first_n, 0}), offset(second_e, {-first_n, 0}))); 
                
                if (cur < best) {
                    best = cur;

                    auto x1 = make_tuple(first_n, m, s, first_e);
                    auto x2 = make_tuple(second_n, m, offset(second_e, {-first_n, 0}), offset(t, {-first_n, 0}));

                    ans = make_pair(x1, x2);
                }
            }

            // s -> second_e && first_e -> t

            if (inside(first_n, m, t) 
                && inside(second_n, m, offset(s, {-first_n, 0}))
                && ok(first_n, m, t, first_e) 
                && ok(second_n, m, offset(s, {-first_n, 0}), offset(second_e, {-first_n, 0}))
            ) {
                int cur = solve(first_n, m, t, first_e);
                if (cur < best) cur = max(cur, solve(second_n, m, offset(s, {-first_n, 0}), offset(second_e, {-first_n, 0})));
                
                if (cur < best) {
                    best = cur;

                    auto x1 = make_tuple(second_n, m, offset(s, {-first_n, 0}), offset(second_e, {-first_n, 0}));
                    auto x2 = make_tuple(first_n, m, first_e, t);

                    ans = make_pair(x1, x2);
                }
            }
        }
    }

    for (int j = min_j; j < max_j; ++j) {
        for (int i = 1; i <= n; ++i) {
            int first_m = j;
            int second_m = m - j;

            pair<int, int> first_e = {i, first_m};
            pair<int, int> second_e = {i, first_m + 1};

            // s -> first_e && second_e -> t

            if (inside(n, first_m, s) 
                && inside(n, second_m, offset(t, {0, -first_m}))
                && ok(n, first_m, s, first_e) 
                && ok(n, second_m, offset(t, {0, -first_m}), offset(second_e, {0, -first_m}))
            ) { 
                int cur = solve(n, first_m, s, first_e);
                if (cur < best) cur = max(cur, solve(n, second_m, offset(t, {0, -first_m}), offset(second_e, {0, -first_m})));
                
                if (cur < best) {
                    best = cur;

                    auto x1 = make_tuple(n, first_m, s, first_e);
                    auto x2 = make_tuple(n, second_m, offset(second_e, {0, -first_m}), offset(t, {0, -first_m}));

                    ans = make_pair(x1, x2);
                }
            }

            // t -> first_e && s -> second_e

            if (inside(n, first_m, t) 
                && inside(n, second_m, offset(s, {0, -first_m}))
                && ok(n, first_m, t, first_e) 
                && ok(n, second_m, offset(s, {0, -first_m}), offset(second_e, {0, -first_m}))
            ) {
                int cur = solve(n, first_m, t, first_e);
                if (cur < best) cur = max(cur, solve(n, second_m, offset(s, {0, -first_m}), offset(second_e, {0, -first_m})));

                if (cur < best) {
                    best = cur;

                    
                    auto x1 = make_tuple(n, second_m, offset(s, {0, -first_m}), offset(second_e, {0, -first_m}));
                    auto x2 = make_tuple(n, first_m, first_e, t);

                    ans = make_pair(x1, x2);
                }
            }
        }
    }

    if (best == n * m) exit(-1);

    mp[make_tuple(n, m, s, t)] = ans;
    return dp[make_tuple(n, m, s, t)] = best;
}

void test_case() {
    int n, m;
    int sy, sx;
    int ty, tx;

    cin >> n >> m >> sy >> sx >> ty >> tx;

    if (!ok(n, m, {sy, sx}, {ty, tx})) {
        cout << "NO" << endl;
        return;
    }

    cout << "YES\n";
    int s = solve(n, m, {sy, sx}, {ty, tx});
    cout << "SCORE: " << s << endl;
    if (s > 100) {
        cout << n << " " << m << " " << sy << " " << sx << " " << ty << " " << tx << endl;
    }
    cout << "CASES: " << dp.size() << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    for (int i = 0; i < t; ++i) {
        test_case();
        //cout << "\n";
    }

    return 0;
}

Test details

Test 1

Group: 1, 5

Verdict:

input
100
1 45 1 45 1 1
1 18 1 1 1 10
1 47 1 17 1 30
1 33 1 28 1 20
...
view save

correct output
YES
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...
view save

user output
YES
SCORE: 19
CASES: 13
NO
NO
...
Truncated

Test 2

Group: 2, 5

Verdict:

input
100
2 43 1 33 1 21
2 2 1 1 2 2
2 32 1 1 2 8
2 14 1 12 1 14
...
view save

correct output
NO
NO
NO
NO
YES
...
view save

user output
NO
NO
NO
NO
YES
...
Truncated

Test 3

Group: 3, 5

Verdict:

input
100
3 4 2 1 2 4
3 38 2 24 1 22
3 29 2 23 2 3
3 8 3 1 1 2
...
view save

correct output
NO
NO
NO
YES
RRRRRRRUULDLULDLULDLLUR
...
view save

user output
NO
NO
NO
YES
SCORE: 18
...
Truncated

Test 4

Group: 4, 5

Verdict:

input
100
4 25 2 19 1 5
4 13 3 10 4 12
4 7 3 1 4 2
4 23 1 19 2 5
...
view save

correct output
YES
DDRRRRRRULLLLLURRRRRULLLLLLLDD...
view save

user output
YES
SCORE: 18
CASES: 11
YES
SCORE: 20
...
Truncated

Test 5

Group: 5

Verdict:

input
100
16 8 13 1 14 8
41 21 19 11 32 12
46 17 13 7 6 11
8 41 4 32 4 12
...
view save

correct output
NO
YES
LURULURULURULURULURRDDDDDDDDDR...
view save

user output
NO
YES
SCORE: 14
CASES: 45
YES
...
Truncated

Test 6

Group: 5

Verdict:

input
100
31 38 18 35 31 37
35 48 7 13 21 21
46 21 25 2 4 19
35 2 13 2 35 1
...
view save

correct output
YES
LLLLLLLLLLLLDRRRRRRRRRRRRDLLLL...
view save

user output
YES
SCORE: 12
CASES: 75
NO
NO
...
Truncated

Test 7

Group: 2, 5

Verdict:

input
100
2 4 1 3 1 4
2 4 2 2 1 1
2 4 2 3 1 2
2 4 2 3 1 4
...
view save

correct output
YES
LLDRRRU
NO
NO
NO
...
view save

user output
YES
SCORE: 8
CASES: 0
NO
NO
...
Truncated

Test 8

Group: 2, 5

Verdict:

input
100
2 5 1 2 2 4
2 5 1 2 1 1
2 5 2 1 1 2
2 5 1 1 1 5
...
view save

correct output
YES
LDRRURRDL
YES
RRRDLLLLU
NO
...
view save

user output
YES
SCORE: 10
CASES: 0
YES
SCORE: 10
...
Truncated

Test 9

Group: 3, 5

Verdict:

input
100
3 4 1 1 2 3
3 4 2 4 3 2
3 4 2 1 3 1
3 4 1 4 3 4
...
view save

correct output
YES
DDRRRUULLDR
NO
YES
URRRDDLULDL
...
view save

user output
YES
SCORE: 12
CASES: 0
NO
YES
...
Truncated

Test 10

Group: 3, 5

Verdict:

input
100
3 5 3 4 3 2
3 5 3 5 2 3
3 5 3 1 2 2
3 5 3 1 3 2
...
view save

correct output
NO
NO
YES
UURRRRDDLULDLU
NO
...
view save

user output
NO
NO
YES
SCORE: 15
CASES: 0
...
Truncated

Test 11

Group: 3, 5

Verdict:

input
100
3 8 2 8 1 2
3 8 2 4 1 7
3 8 3 4 2 7
3 8 2 5 3 1
...
view save

correct output
NO
NO
NO
YES
LLLDRRRRURDRUULLLLLLLDD
...
view save

user output
NO
NO
NO
YES
SCORE: 18
...
Truncated

Test 12

Group: 3, 5

Verdict:

input
100
3 9 1 3 2 9
3 9 1 6 1 5
3 9 3 6 2 8
3 9 3 2 3 4
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
Truncated

Test 13

Group: 4, 5

Verdict:

input
100
4 4 2 2 1 4
4 4 4 1 2 2
4 4 2 1 4 3
4 4 3 1 3 3
...
view save

correct output
YES
DDLUUURRDDDRUUU
YES
UUURRRDLDRDLLUU
NO
...
view save

user output
YES
SCORE: 16
CASES: 0
YES
SCORE: 16
...
Truncated

Test 14

Group: 5

Verdict:

input
100
12 27 6 22 1 8
6 25 3 2 4 4
6 16 4 6 5 2
36 33 8 6 1 6
...
view save

correct output
YES
DLDDDDDRUUUURDDDDRUURDDRRULURU...
view save

user output
YES
SCORE: 16
CASES: 69
YES
SCORE: 20
...
Truncated

Test 15

Group: 3, 5

Verdict:

input
100
3 12 3 5 1 4
3 20 3 19 2 19
3 34 3 9 2 9
3 38 2 15 3 15
...
view save

correct output
YES
RRRRRRRUULDLULDLULDLULDLDLULDL...
view save

user output
YES
SCORE: 18
CASES: 3
YES
SCORE: 18
...
Truncated

Test 16

Group: 5

Verdict:

input
100
50 50 29 1 16 21
50 50 37 5 23 48
50 50 32 22 45 24
50 50 6 28 12 37
...
view save

correct output
YES
DDDDDDDDDDDDDDDDDDDDDRUUUUUUUU...
view save

user output
YES
SCORE: 16
CASES: 341
YES
SCORE: 18
...
Truncated

Tasks

A Neliöt-B Peli-C Tekijät-D Ruudukko-

Submissions (Mahtimursu)

2023-05-30 00:38:05 1002023-05-30 00:36:17 442023-05-30 00:34:00 1002023-05-30 00:32:46 1002023-05-30 00:31:42 452023-05-15 00:48:24 1002023-05-15 00:33:39 722023-05-15 00:31:16 722023-05-15 00:30:40 442023-05-15 00:29:30 2023-05-14 21:31:15 1002023-05-14 21:30:33 722023-05-14 21:29:47 722023-05-14 21:23:52 1002023-05-14 21:08:19 1002023-05-14 20:59:45 442023-05-14 20:59:13 1002023-05-14 20:43:01 1002023-05-14 18:55:04 1002023-05-09 02:07:35 1002023-05-09 01:46:50 1002023-05-09 01:46:21 02023-05-09 01:40:51 1002023-05-09 00:57:19 172023-05-09 00:54:07 52023-05-09 00:34:49 52023-05-04 23:52:48 1002023-05-04 23:52:02 1002023-05-04 23:51:22 442023-05-04 23:50:35 442023-05-04 23:49:30 442023-05-04 23:46:44 1002023-05-04 23:44:09 442023-05-04 23:41:34 1002023-04-26 21:27:02 1002023-04-26 21:22:19 1002023-04-25 16:55:53 1002023-04-25 16:52:52 1002023-04-25 16:51:57 1002023-04-12 20:32:48 1002023-04-12 20:23:49 1002023-04-12 20:20:21 1002023-04-12 02:32:30 1002023-04-12 02:29:58 1002023-04-12 02:27:58 1002023-04-12 02:27:16 1002023-04-12 02:26:20 722023-04-12 02:25:21 722023-04-12 02:11:27 722023-04-07 14:18:25 1002023-04-07 14:17:16 1002023-04-07 14:15:49 1002023-04-07 14:13:50 1002023-04-05 18:32:52 1002023-04-05 18:31:13 1002023-04-05 18:28:50 722023-04-05 18:28:38 172023-04-05 18:18:57 722023-04-05 18:17:14 722023-04-05 18:16:24 722023-04-05 18:14:57 172023-04-05 18:09:14 722023-04-05 18:08:52 1002023-04-05 18:07:02 1002023-04-05 18:06:17 52023-04-05 18:04:25 52023-03-23 18:50:28 1002023-03-23 18:50:02 722023-03-21 18:36:36 1002023-03-21 18:35:07 722023-03-21 18:34:32 1002023-03-21 18:32:15 1002023-03-21 18:21:28 1002023-03-21 18:21:11 442023-03-21 18:20:08 722023-03-21 18:19:40 1002023-03-21 18:19:21 1002023-03-21 18:10:59 442023-03-21 17:59:57 442023-03-21 17:52:46 442023-03-21 00:46:49 02023-03-21 00:44:46 02023-03-21 00:44:33 02023-03-21 00:44:00 02023-03-21 00:43:00 02023-03-21 00:41:06 02023-03-21 00:40:14 02023-03-21 00:14:25 1002023-03-21 00:14:06 1002023-03-21 00:09:45 1002023-03-21 00:09:30 02023-03-21 00:06:28 722023-03-21 00:03:45 1002023-03-21 00:02:41 172023-03-21 00:02:13 172023-03-20 23:59:01 1002023-03-20 23:46:38 1002023-03-20 23:37:32 1002023-03-20 23:37:05 722023-03-20 23:29:42 1002023-03-17 23:56:27 1002023-03-17 23:21:38 1002023-03-17 23:14:29 52023-03-17 23:14:14 322023-03-17 23:13:20 52023-03-17 23:12:51 02023-03-17 23:11:51 02023-03-17 23:09:25 52023-03-17 23:08:53 52023-03-17 23:04:27 322023-03-17 00:14:08 1002023-03-17 00:12:07 1002023-03-17 00:11:35 52023-03-17 00:06:20 52023-03-17 00:03:32 02023-03-16 23:56:49 1002023-03-16 23:53:34 1002023-03-16 23:40:59 1002023-03-16 23:40:29 1002023-03-16 23:32:36 1002023-03-16 23:15:46 1002023-03-16 23:12:05 1002023-03-16 23:08:53 1002023-03-16 23:06:44 722023-03-16 23:05:33 1002023-03-16 22:50:31 452023-03-16 22:50:00 722023-03-11 14:57:05 1002023-03-11 14:54:27 1002023-03-11 14:52:10 722023-03-11 14:45:42 52023-03-11 14:33:10 172023-03-11 03:50:23 172023-03-11 03:50:09 52023-03-11 03:42:21 172023-03-11 03:37:38 172023-03-11 02:58:50 172023-03-11 02:57:20 172023-03-11 01:01:08 172023-03-11 00:53:52 52023-03-11 00:53:37 52023-03-11 00:46:39 02023-03-11 00:43:24 52023-03-11 00:37:20 52023-03-11 00:30:32 52023-03-11 00:25:39 02023-03-11 00:24:52 02023-03-11 00:05:37 02023-03-11 00:01:20 02023-03-10 23:52:27 02023-03-10 23:45:01 02023-03-10 23:42:31 02023-03-10 23:41:30 02023-03-10 23:41:14 02023-03-10 23:40:05 02023-03-10 23:38:13 02023-03-10 23:14:28 02023-03-10 23:13:56 02023-03-10 23:08:25 02023-03-10 21:42:30 02023-03-10 21:42:05 2023-03-10 19:56:09 02023-03-10 19:44:49 02023-03-10 19:24:35 02023-03-10 19:23:13 02023-03-10 19:16:42 02023-03-10 19:15:03 02023-03-10 19:14:37 02023-03-10 19:14:25 02023-03-10 19:09:01 02023-03-10 01:49:06 02023-03-10 01:45:17 02020-11-07 19:55:55 52020-11-07 19:03:45 52020-11-07 19:03:06 52020-11-06 19:31:36 52020-11-06 19:00:39 52020-11-06 18:59:56 0