Submission #1028754

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028754		Mardonbekhazratov	디지털 회로 (IOI22_circuit)	C++17	2 / 100	1380 ms	1368 KiB

circuit

#include "circuit.h"

#include <vector>
#include <tuple>
#include <iostream>

using namespace std;

int n,m;
vector<int>p,a;

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    tie(n,m,p,a)=tie(N,M,P,A);
}

int count_ways(int L, int R) {
    int ans=0;
    for(int i=L;i<=R;i++) a[i-n]^=1;
    for(int i=0;i<m;i++) ans+=a[i];
    return ans;
}

• 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