Submission #744300

#	Time	Username	Problem	Language	Result	Execution time	Memory
744300		saayan007	Mars (APIO22_mars)	C++17	0 / 100	1 ms	200 KiB

mars

#include "bits/stdc++.h"
using namespace std;

/* #define int long long */
#define fr first
#define sc second
#define eb emplace_back
const char nl = '\n';
#include "mars.h"

string conToStr(int res) {
    string ans;
    for(int i = 0; i < 100; ++i) {
        if(res % 2) ans.push_back('1');
        else ans.push_back('0');
        res /= 2;
    }
    return ans;
}

int conToInt(string x) {
    int res = 0;
    for(int i = 99; i >= 0; --i) {
        res *= 2;
        if(x[i] == '1') res = res + 1;
    }
    return res;
}

string process(vector <vector<string>> a, int i, int j, int k, int n)
{
    int res = 0;
    if(n == 2) {
        if(k == 0) {
            for(int di = 0; di < 3; ++di) {
                for(int dj = 0; dj < 3; ++dj) {
                    int x = i + di, y = j + dj;
                    int add = 0;
                    if(a[di][dj][0] == '1') ++add;
                    int mi = (x > 2 ? 5 - x : x + 1);
                    int mj = (y > 2 ? 5 - y : y + 1);
                    res += add * 36 / (mi * mj);
                }
            }
            /* cout << res << ' '; */
            /* if(j + 2 == 2*n) cout << nl; */
            string ans = "";
            for(int i = 0; i < 100; ++i) {
                if(res % 2) ans.push_back('1');
                else ans.push_back('0');
                res /= 2;
            }
            return ans;
        }
        else {
            for(int di = 0; di < 3; ++di) {
                for(int dj = 0; dj < 3; ++dj) {
                    int ans = 0;
                    for(int i = 99; i >= 0; --i) {
                        ans *= 2;
                        if(a[di][dj][i] == '1') ans = ans + 1;
                    }
                    res += ans;
                }
            }
            res /= 36;
            string ans = "";
            for(int i = 0; i < 100; ++i) {
                if(res % 2) ans.push_back('1');
                else ans.push_back('0');
                res /= 2;
            }
            return ans;
        }
    }
    else {
        for(int di = 0; di < 3; ++di) {
            for(int dj = 0; dj < 3; ++dj) {
                int ans = 0;
                for(int i = 99; i >= 0; --i) {
                    ans *= 2;
                    if(a[di][dj][i] == '1') ans = ans + 1;
                }
                res += ans;
            }
        }
        string ans = "";
        for(int i = 0; i < 100; ++i) {
            if(res % 2) ans.push_back('1');
            else ans.push_back('0');
            res /= 2;
        }
        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