Submission #821322

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
821322	2023-08-11 09:07:22	Hanksburger	Mars (APIO22_mars)	C++17	54 / 100	278 ms	3804 KiB

mars

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "mars.h"
#include <bits/stdc++.h>
using namespace std;
string process(vector<vector<string> > a, int i, int j, int k, int n)
{
    int il0=(2*n+1)*  i  /(2*(n-k)+1)+1;
    int ir0=(2*n+1)*(i+1)/(2*(n-k)+1);
    int il1=(2*n+1)*(i+1)/(2*(n-k)+1)+1;
    int ir1=(2*n+1)*(i+2)/(2*(n-k)+1);
    int il2=(2*n+1)*(i+2)/(2*(n-k)+1)+1;
    int ir2=(2*n+1)*(i+3)/(2*(n-k)+1);
    
    int jl0=(2*n+1)*  j  /(2*(n-k)+1)+1;
    int jr0=(2*n+1)*(j+1)/(2*(n-k)+1);
    int jl1=(2*n+1)*(j+1)/(2*(n-k)+1)+1;
    int jr1=(2*n+1)*(j+2)/(2*(n-k)+1);
    int jl2=(2*n+1)*(j+2)/(2*(n-k)+1)+1;
    int jr2=(2*n+1)*(j+3)/(2*(n-k)+1);
    
    int iltarget=(2*n+1)*  i  /(2*(n-k-1)+1)+1;
    int irtarget=(2*n+1)*(i+1)/(2*(n-k-1)+1);
    
    int jltarget=(2*n+1)*  j  /(2*(n-k-1)+1)+1;
    int jrtarget=(2*n+1)*(j+1)/(2*(n-k-1)+1);
    char arr[45][45];
    for (int i=il0; i<=ir0; i++)
    {
        for (int j=jl0; j<=jr0; j++)
            arr[i][j]=a[0][0][(i-il0)*(jr0-jl0+1)+j-jl0];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 7 / 7
• Subtask 4: 8 / 8
• Subtask 5: 7 / 7
• Subtask 6: 8 / 8
• Subtask 7: 10 / 10
• Subtask 8: 0 / 24
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11