Submission #724403

#	Time	Username	Problem	Language	Result	Execution time	Memory
724403		MohamedAliSaidane	Mars (APIO22_mars)	C++17	0 / 100	1 ms	416 KiB

mars

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

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef vector<pii> vpi;

#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(),(x).end()

const ll MOD = 1e9 + 7, INF = 1e18;
ll mod(ll x, ll m = MOD) {return (x + m) % m;}


string process(vector<vector<string>> a, int i, int j, int k, int n)
{
    if(k == n -1)
    {
        string ans = "";
        for(int i = 0; i < 100; i++)
            ans += '0';

        for(int l = i; l < i + 3; l++)
        {
            for(int p = j; p < j+3; p++)
            {
                int id = n * l + p;
                ans[id] = a[l - i][p - j][0];
            }
        }
        return ans;
    }
    int bs[3][3][100];
    for(int l = i; l < i + 3; l++)
    {
        for(int p = j; p < j+3; p++)
        {
            for(int h = 0; h < 100; h++)
                bs[l][p][h] |=  (int)(a[l][p][h] - '0');
        }
    }
    string ans = "";
    for(int h = 0; h < 100; h++)
        ans += (char)('0' + (int)(bs[0][0][h]));
    return ans;
}

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