제출 #972153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972153		grafff	Digital Circuit (IOI22_circuit)	C++17	2 / 100	1251 ms	3160 KiB

circuit

#include <bits/stdc++.h>
#include "circuit.h"
#define ll int
#define all(x) x.begin(), x.end()
#define x_c first
#define y_c second

using namespace std;

ll n, m, MOD = 1000002022;
vector <ll> p, a;
vector <bool> flag(9);
vector <vector <ll>> gr;

int group_1(int l, int r)
{
    for(int i = l; i <= r; i++)
    {
        a[i - n] = 1 - a[i - n];
    }
    ll col = 0;
    for(int i = 0; i < m; i++)
    {
        col += a[i];
    }
    return col;
}

int count_ways(int L, int R)
{
    return group_1(L, R);
}

void init(int N, int M, vector <int> P, vector <int> A)
{
    n = N;
    m = M;
    p = P;
    a = A;
    gr.resize(n);
    ll mx = 0;
    for(int i = 1; i < n + m; i++)
    {
        gr[p[i]].push_back(i);
        ll h = gr[p[i]].size();
        mx = max(mx, h);
    }
    if(n == 1)
    {
        flag[1] = true;
    }
    else if(n <= 1000 && mx <= 2)
    {
        flag[2] = true;
    }
    else if(mx <= 2)
    {
        flag[6] = true;
    }
    else if(n <= 1000 && m <= 1000)
    {
        flag[3] = true;
    }
    else if(n <= 5000 && m <= 5000)
    {
        flag[7] = true;
    }
}
/*
int main()
{
}*/

• Subtask 1: 2 / 2
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 4
• Subtask 5: 0 / 12
• Subtask 6: 0 / 27
• Subtask 7: 0 / 28
• Subtask 8: 0 / 11