제출 #1164537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164537		binminh01	Broken Device (JOI17_broken_device)	C++20	100 / 100	34 ms	1452 KiB

Anna

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);

#include "Annalib.h"
void Anna(int n, ll x, int k, int p[]) {
    vector<int> c(n);
    For(i,0,k) c[p[i]] = 1;
    string s, t(60, '0');
    For(i,0,60) if (x >> i & 1) t[i] = '1';
    for (int i = 0, j = 0; i < n && j < 60; i+=3) {
        if (c[i] + c[i + 1] + c[i + 2] > 1) {s+="000"; continue;}
        string w; w+=t[j++];
        if (c[i] + c[i + 1] + c[i + 2] == 0 && j < 60) w+=t[j++];
        if (w == "00") s+="001";
        if (w == "01") s+="011";
        if (w == "10") s+="110";
        if (w == "11") s+="111";
        if (w == "1") s+=c[i + 1] ? "101": "010";
        if (w == "0") {
            if (c[i]) s+=(j == 60 || t[j] == '0') ? "001": "011", ++j;
            else s+="100";
        }
    }
    s+=string(n - sz(s), '0');
    For(i,0,n) Set(i, s[i] - '0');
}

Bruno

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);

#include "Brunolib.h"
ll Bruno(int n, int a[]) {
    string s;
    for (int i = 0; i < n; i+=3) {
        string w;
        For(j,i,i+3) w+=a[j] + '0';
        if (w == "001") s+="00";
        if (w == "011") s+="01";
        if (w == "110") s+="10";
        if (w == "111") s+="11";
        if (w == "101" || w == "010") s+='1';
        if (w == "100") s+='0';
    }
    ll x = 0;
    For(i,0,60) if (s[i] == '1') x^=1ll << i;
    return x;
}

• Subtask 1: 100 / 100