oj.uz

Submission #951558

# Submission time Handle Problem Language Result Execution time Memory
951558 2024-03-22T06:22:08 Z GrindMachine Navigation 2 (JOI21_navigation2) C++17
85 / 100
 588 ms 2500 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi
https://codeforces.com/blog/entry/88748?#comment-774016 (this thread)

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Anna.h"

void Anna(int n, int k, std::vector<int> R, std::vector<int> C) {
    int a[n][n];
    rep(i,n) rep(j,n) a[i][j] = 1;

    vector<bool> used(10);

    rep(i,n){
        rep(j,n){
            int ind = (i%3)*3+(j%3);
            if(!ind){
                a[i][j] = 14;
            }
            else{
                if(ind <= k){
                    int r = R[ind-1], c = C[ind-1];
                    int d = max(abs(i-r),abs(j-c));
                    if(d > 1){
                        // (i,j+1)
                        if(j+2 <= c){
                            a[i][j] = 10;
                        }
                        // (i,j-1)
                        else if(j-2 >= c){
                            a[i][j] = 11;
                        }
                        // (i+1,j)
                        else if(i+2 <= r){
                            a[i][j] = 12;
                        }
                        // (i-1,j)
                        else if(i-2 >= r){
                            a[i][j] = 13;
                        }
                        else{
                            assert(0);
                        }
                    }
                    else{
                        int d1 = i-r+1, d2 = j-c+1;
                        a[i][j] = (d1*3)+d2+1;
                        used[a[i][j]] = 1;
                    }
                }
            }
        }
    }

    int unused = -1;
    rep1(i,9){
        if(!used[i]){
            unused = i;
            break;
        }
    }

    assert(unused != -1);
    assert(unused <= 8);

    rep(i,n){
        rep(j,n){
            int ind = (i%3)*3+(j%3);
            if(ind == 8){
                a[i][j] = unused;
            }
            else{
                if(a[i][j] > unused){
                    a[i][j]--;
                }
            }
        }
    }

    rep(i,n){
        rep(j,n){
            // cout << a[i][j] << " ";
            SetFlag(i,j,a[i][j]);
        }
        // cout << endl;
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi
https://codeforces.com/blog/entry/88748?#comment-774016 (this thread)

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Bruno.h"

std::vector<int> Bruno(int k, std::vector<int> values) {
    int a[3][3];
    memset(a,0,sizeof a);
    rep(i,sz(values)){
        a[i/3][i%3] = values[i];
    }

    // rep(i,3){
    //     rep(j,3){
    //         cout << a[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    // cout << endl;

    int zi = -1, zj = -1;
    rep(i,3){
        rep(j,3){
            if(a[i][j] == 13){
                assert(zi == -1);
                zi = i, zj = j;
            } 
        }
    }

    assert(zi != -1);

    int label[3][3];
    label[zi][zj] = 0;

    rep1(iter,8){
        if(iter%3 == 0){
            zi = (zi+1)%3;
        }
        zj = (zj+1)%3;
        label[zi][zj] = iter;
    }

    int unused = a[zi][zj];
    rep(i,3){
        rep(j,3){
            if(a[i][j] >= unused){
                a[i][j]++;
            }
        }
    }

    vector<pii> cells = {{1,2},{1,0},{2,1},{0,1}};
    vector<int> di = {0,0,1,-1,0};
    vector<int> dj = {1,-1,0,0,0};

    vector<int> ans(k);
    rep(i,3){
        rep(j,3){
            int ind = label[i][j];
            if(!ind or ind > k) conts;

            ind--;
            pii cell = {-1,-1};

            if(a[i][j] > 9){
                int x = a[i][j]-10;
                ans[ind] = x;
                conts;
            }
            else{
                int v = a[i][j]-1;
                cell = {i,j};
                auto &[r,c] = cell;

                if(v == 0){
                    r++, c++;
                }
                if(v == 1){
                    r++;
                }
                if(v == 2){
                    r++, c--;
                }
                if(v == 3){
                    c++;
                }
                if(v == 4){

                }
                if(v == 5){
                    c--;
                }
                if(v == 6){
                    r--, c++;
                }
                if(v == 7){
                    r--;
                }
                if(v == 8){
                    r--, c--;
                }
            }

            // cout << cell.ff << " " << cell.ss << endl;    
            auto [r,c] = cell;
            int dir = 4;

            // cout << i << " " << j << endl;
            // cout << r << " " << c << endl;

            // (i,j+1)
            if(1 < c){
                dir = 0;
            }
            // (i,j-1)
            else if(1 > c){
                dir = 1;
            }
            // (i+1,j)
            else if(1 < r){
                dir = 2;
            }
            else if(1 > r){
                dir = 3;
            }

            ans[ind] = dir;
        }
    }

    // cout << endl;

    // rep(i,k){
    //     cout << ans[i] << " ";
    // }
    // cout << endl;

    return ans;

    // int b[3][3];

    // vector<int> ans;

    // rep(x,k){
    //     rep(i,3){
    //         rep(j,3){
    //             int &mask = a[i][j];
    //             b[i][j] = mask%3;
    //             mask /= 3;
    //         }
    //     }

    //     int final_dir = 4;

    //     rep(dir,4){
    //         auto [i,j] = cells[dir];
    //         if((b[i][j]+1)%3 == b[1][1]){
    //             final_dir = dir;
    //         }
    //     }

    //     ans.pb(final_dir);
    // }

    // return ans;
}

Subtask #1
85.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 10 ms 664 KB Partially correct
2 Partially correct 10 ms 664 KB Partially correct
3 Partially correct 8 ms 664 KB Partially correct
4 Partially correct 8 ms 664 KB Partially correct
5 Partially correct 10 ms 664 KB Partially correct
6 Partially correct 11 ms 664 KB Partially correct
7 Partially correct 9 ms 1164 KB Partially correct
8 Partially correct 9 ms 920 KB Partially correct
9 Partially correct 9 ms 920 KB Partially correct
10 Partially correct 10 ms 664 KB Partially correct
11 Partially correct 9 ms 748 KB Partially correct
12 Partially correct 10 ms 664 KB Partially correct
13 Partially correct 9 ms 664 KB Partially correct
14 Partially correct 10 ms 920 KB Partially correct
15 Partially correct 11 ms 664 KB Partially correct
16 Partially correct 9 ms 920 KB Partially correct
17 Partially correct 9 ms 664 KB Partially correct
18 Partially correct 9 ms 664 KB Partially correct
19 Partially correct 8 ms 664 KB Partially correct
20 Partially correct 9 ms 920 KB Partially correct
21 Partially correct 9 ms 664 KB Partially correct
22 Partially correct 12 ms 920 KB Partially correct
23 Partially correct 11 ms 664 KB Partially correct
24 Partially correct 8 ms 672 KB Partially correct
25 Partially correct 7 ms 920 KB Partially correct
26 Partially correct 11 ms 664 KB Partially correct
27 Partially correct 9 ms 664 KB Partially correct
28 Partially correct 9 ms 920 KB Partially correct
29 Partially correct 9 ms 920 KB Partially correct
30 Partially correct 11 ms 664 KB Partially correct
31 Partially correct 10 ms 752 KB Partially correct
32 Partially correct 10 ms 920 KB Partially correct
33 Partially correct 7 ms 676 KB Partially correct
34 Partially correct 9 ms 1088 KB Partially correct
35 Partially correct 9 ms 920 KB Partially correct
36 Partially correct 8 ms 920 KB Partially correct
37 Partially correct 11 ms 944 KB Partially correct
38 Partially correct 10 ms 676 KB Partially correct
39 Partially correct 13 ms 676 KB Partially correct
40 Partially correct 9 ms 932 KB Partially correct
41 Partially correct 10 ms 684 KB Partially correct
42 Partially correct 11 ms 780 KB Partially correct
43 Partially correct 10 ms 948 KB Partially correct
44 Partially correct 10 ms 944 KB Partially correct
45 Partially correct 10 ms 944 KB Partially correct
46 Partially correct 10 ms 688 KB Partially correct
47 Partially correct 11 ms 944 KB Partially correct
48 Partially correct 13 ms 944 KB Partially correct
49 Partially correct 10 ms 1116 KB Partially correct
50 Partially correct 11 ms 944 KB Partially correct
51 Partially correct 10 ms 688 KB Partially correct
52 Partially correct 11 ms 688 KB Partially correct
53 Partially correct 12 ms 944 KB Partially correct
54 Partially correct 10 ms 944 KB Partially correct
55 Partially correct 10 ms 944 KB Partially correct
56 Partially correct 13 ms 664 KB Partially correct
57 Partially correct 15 ms 920 KB Partially correct
58 Partially correct 13 ms 920 KB Partially correct
59 Partially correct 11 ms 664 KB Partially correct
60 Partially correct 11 ms 920 KB Partially correct
61 Partially correct 13 ms 664 KB Partially correct
62 Partially correct 11 ms 664 KB Partially correct
63 Partially correct 13 ms 684 KB Partially correct
64 Partially correct 11 ms 944 KB Partially correct
65 Partially correct 12 ms 944 KB Partially correct
66 Partially correct 10 ms 944 KB Partially correct
67 Partially correct 11 ms 688 KB Partially correct
68 Partially correct 13 ms 688 KB Partially correct
69 Partially correct 12 ms 944 KB Partially correct
70 Partially correct 11 ms 944 KB Partially correct
71 Partially correct 13 ms 948 KB Partially correct
72 Partially correct 13 ms 688 KB Partially correct
73 Partially correct 12 ms 948 KB Partially correct
74 Partially correct 12 ms 944 KB Partially correct
75 Partially correct 13 ms 688 KB Partially correct
76 Partially correct 13 ms 1200 KB Partially correct
77 Partially correct 12 ms 948 KB Partially correct
78 Partially correct 12 ms 688 KB Partially correct
79 Partially correct 13 ms 932 KB Partially correct
80 Partially correct 13 ms 944 KB Partially correct
81 Partially correct 10 ms 688 KB Partially correct
82 Partially correct 11 ms 944 KB Partially correct
83 Partially correct 12 ms 688 KB Partially correct
84 Partially correct 13 ms 684 KB Partially correct
85 Partially correct 11 ms 696 KB Partially correct
86 Partially correct 13 ms 944 KB Partially correct
87 Partially correct 12 ms 1104 KB Partially correct
88 Partially correct 11 ms 956 KB Partially correct
89 Partially correct 12 ms 676 KB Partially correct
90 Partially correct 11 ms 944 KB Partially correct
91 Partially correct 11 ms 688 KB Partially correct
92 Partially correct 12 ms 940 KB Partially correct
93 Partially correct 13 ms 948 KB Partially correct
94 Partially correct 12 ms 664 KB Partially correct
95 Partially correct 13 ms 664 KB Partially correct
96 Partially correct 12 ms 664 KB Partially correct
97 Partially correct 12 ms 668 KB Partially correct
98 Partially correct 13 ms 688 KB Partially correct
99 Partially correct 14 ms 944 KB Partially correct
100 Partially correct 11 ms 944 KB Partially correct
101 Partially correct 13 ms 684 KB Partially correct
102 Partially correct 13 ms 944 KB Partially correct
103 Partially correct 12 ms 696 KB Partially correct
104 Partially correct 13 ms 944 KB Partially correct
105 Partially correct 13 ms 944 KB Partially correct
106 Partially correct 12 ms 944 KB Partially correct
107 Partially correct 12 ms 688 KB Partially correct
108 Partially correct 12 ms 772 KB Partially correct
109 Partially correct 11 ms 768 KB Partially correct
110 Partially correct 13 ms 944 KB Partially correct
111 Partially correct 13 ms 688 KB Partially correct
112 Partially correct 11 ms 944 KB Partially correct
113 Partially correct 15 ms 688 KB Partially correct
114 Partially correct 14 ms 688 KB Partially correct
115 Partially correct 10 ms 944 KB Partially correct
116 Partially correct 12 ms 676 KB Partially correct
117 Partially correct 12 ms 944 KB Partially correct
118 Partially correct 11 ms 688 KB Partially correct
119 Partially correct 11 ms 688 KB Partially correct
120 Partially correct 547 ms 2160 KB Partially correct
121 Partially correct 473 ms 1928 KB Partially correct
122 Partially correct 455 ms 1548 KB Partially correct
123 Partially correct 476 ms 1944 KB Partially correct
124 Partially correct 490 ms 2044 KB Partially correct
125 Partially correct 458 ms 1932 KB Partially correct
126 Partially correct 484 ms 2500 KB Partially correct
127 Partially correct 454 ms 2016 KB Partially correct
128 Partially correct 459 ms 1932 KB Partially correct
129 Partially correct 498 ms 1896 KB Partially correct
130 Partially correct 495 ms 1864 KB Partially correct
131 Partially correct 517 ms 1780 KB Partially correct
132 Partially correct 531 ms 1612 KB Partially correct
133 Partially correct 517 ms 2316 KB Partially correct
134 Partially correct 486 ms 1836 KB Partially correct
135 Partially correct 530 ms 1564 KB Partially correct
136 Partially correct 564 ms 1632 KB Partially correct
137 Partially correct 516 ms 1484 KB Partially correct
138 Partially correct 509 ms 1948 KB Partially correct
139 Partially correct 519 ms 1352 KB Partially correct
140 Partially correct 506 ms 1984 KB Partially correct
141 Partially correct 461 ms 1820 KB Partially correct
142 Partially correct 533 ms 1940 KB Partially correct
143 Partially correct 523 ms 2120 KB Partially correct
144 Partially correct 506 ms 1872 KB Partially correct
145 Partially correct 482 ms 1548 KB Partially correct
146 Partially correct 588 ms 1544 KB Partially correct
147 Partially correct 489 ms 1760 KB Partially correct
148 Partially correct 487 ms 1980 KB Partially correct
149 Partially correct 553 ms 2020 KB Partially correct
150 Partially correct 532 ms 1824 KB Partially correct
151 Partially correct 491 ms 1572 KB Partially correct
152 Partially correct 531 ms 1504 KB Partially correct
153 Partially correct 465 ms 2368 KB Partially correct
154 Partially correct 480 ms 1996 KB Partially correct
155 Partially correct 518 ms 1700 KB Partially correct
156 Partially correct 540 ms 2020 KB Partially correct
157 Partially correct 525 ms 1712 KB Partially correct
158 Partially correct 457 ms 1556 KB Partially correct
159 Partially correct 473 ms 1788 KB Partially correct
160 Partially correct 532 ms 2052 KB Partially correct
161 Partially correct 476 ms 1808 KB Partially correct
162 Partially correct 499 ms 2076 KB Partially correct
163 Partially correct 451 ms 1488 KB Partially correct
164 Partially correct 482 ms 1552 KB Partially correct
165 Partially correct 465 ms 1736 KB Partially correct
166 Partially correct 502 ms 1776 KB Partially correct
167 Partially correct 502 ms 1516 KB Partially correct
168 Partially correct 490 ms 1700 KB Partially correct
169 Partially correct 494 ms 1992 KB Partially correct
170 Partially correct 462 ms 1820 KB Partially correct
171 Partially correct 480 ms 2192 KB Partially correct
172 Partially correct 485 ms 1732 KB Partially correct
173 Partially correct 520 ms 2268 KB Partially correct
174 Partially correct 477 ms 1576 KB Partially correct
175 Partially correct 533 ms 2120 KB Partially correct
176 Partially correct 494 ms 1772 KB Partially correct
177 Partially correct 495 ms 1808 KB Partially correct
178 Partially correct 469 ms 1536 KB Partially correct
179 Partially correct 474 ms 2148 KB Partially correct
180 Partially correct 496 ms 2116 KB Partially correct
181 Partially correct 465 ms 1944 KB Partially correct
182 Partially correct 468 ms 1856 KB Partially correct
183 Partially correct 478 ms 1644 KB Partially correct
184 Partially correct 459 ms 1748 KB Partially correct
185 Partially correct 480 ms 1924 KB Partially correct
186 Partially correct 515 ms 1784 KB Partially correct
187 Partially correct 478 ms 1888 KB Partially correct
188 Partially correct 524 ms 2036 KB Partially correct
189 Partially correct 491 ms 1564 KB Partially correct
190 Partially correct 500 ms 1812 KB Partially correct
191 Partially correct 501 ms 2184 KB Partially correct
192 Partially correct 536 ms 1472 KB Partially correct
193 Partially correct 473 ms 1632 KB Partially correct
194 Partially correct 489 ms 2096 KB Partially correct
195 Partially correct 521 ms 1936 KB Partially correct
196 Partially correct 470 ms 1768 KB Partially correct
197 Partially correct 483 ms 1604 KB Partially correct
198 Partially correct 467 ms 1864 KB Partially correct
199 Partially correct 457 ms 1808 KB Partially correct
200 Partially correct 518 ms 2340 KB Partially correct
201 Partially correct 520 ms 1716 KB Partially correct
202 Partially correct 458 ms 2064 KB Partially correct
203 Partially correct 479 ms 1596 KB Partially correct
204 Partially correct 550 ms 2236 KB Partially correct
205 Partially correct 492 ms 2484 KB Partially correct
206 Partially correct 461 ms 1820 KB Partially correct
207 Partially correct 454 ms 2076 KB Partially correct
208 Partially correct 468 ms 2096 KB Partially correct
209 Partially correct 517 ms 1796 KB Partially correct
210 Partially correct 387 ms 1508 KB Partially correct
211 Partially correct 362 ms 1984 KB Partially correct
212 Partially correct 356 ms 1860 KB Partially correct
213 Partially correct 383 ms 1704 KB Partially correct
214 Partially correct 378 ms 1592 KB Partially correct
215 Partially correct 363 ms 1704 KB Partially correct
216 Partially correct 431 ms 1960 KB Partially correct
217 Partially correct 407 ms 1720 KB Partially correct
218 Partially correct 358 ms 1780 KB Partially correct
219 Partially correct 374 ms 1880 KB Partially correct
220 Partially correct 348 ms 1852 KB Partially correct
221 Partially correct 358 ms 1864 KB Partially correct
222 Partially correct 372 ms 1552 KB Partially correct
223 Partially correct 353 ms 2212 KB Partially correct
224 Partially correct 365 ms 2116 KB Partially correct
225 Partially correct 361 ms 1756 KB Partially correct
226 Partially correct 381 ms 1728 KB Partially correct