oj.uz

답안 #1028351

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028351 2024-07-19T17:03:10 Z 42kangaroo 디지털 회로 (IOI22_circuit) C++17
0 / 100
 468 ms 2648 KB 
#include "circuit.h"

#include <vector>

using namespace std;

int ma;
using ll = long long;

constexpr ll mod = 1000002022;

struct SVal {
	ll pos, fpos, tPos;
};

SVal comb(SVal l, SVal r) {
	return SVal{((2*l.tPos*r.tPos)%mod - ((l.tPos - l.pos)*(r.tPos - r.pos))%mod + mod + (l.pos*r.pos)%mod)%mod, ((2*l.tPos*r.tPos)%mod - ((l.tPos - l.fpos)*(r.tPos - r.fpos))%mod + mod + (l.fpos*r.fpos)%mod)%mod, (2*l.tPos*r.tPos)%mod};
}

struct SegTe {
	vector<SVal> a;
	vector<bool> lazy;

	void push(int i) {
		if (lazy[i]) {
			swap(a[i].pos, a[i].fpos);
			if (2*i + 2 < a.size()) {
				lazy[2*i + 1] = !lazy[2*i + 1];
				lazy[2*i + 2] = !lazy[2*i + 2];
			}
			lazy[i] = false;
		}
	}

	SVal toggle(int l, int r, int i, int lq, int rq) {
		push(i);
		if (rq <= l || r <= lq) return a[i];
		if (lq <= l && r <= rq) {
			lazy[i] = true;
			push(i);
			return a[i];
		}
		int m = (l + r)/2;
		return a[i] = comb(toggle(l, m, 2*i + 1, lq, rq), toggle(m, r, 2*i + 2, lq, rq));
	}
};

SegTe se;

void init(int N, int M, std::vector<int> P, std::vector<int> A) {
	ma = N;
	se = SegTe{vector<SVal>(2*M, SVal{0, 1, 1}), vector<bool>(2*M, false)};
	for (int i = 0; i < M; ++i) {
		se.toggle(0, M, 0, i, i + 1);
	}
}

int count_ways(int L, int R) {
	L -= ma;
	R -= ma;
	return se.toggle(0, ma + 1, 0, L, R + 1).pos;
}

Compilation message

circuit.cpp: In member function 'void SegTe::push(int)':
circuit.cpp:27:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<SVal>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |    if (2*i + 2 < a.size()) {
      |        ~~~~~~~~^~~~~~~~~~

Subtask #1
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 468 ms 2648 KB 1st lines differ - on the 1st token, expected: '431985922', found: '862000256'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 468 ms 2648 KB 1st lines differ - on the 1st token, expected: '431985922', found: '862000256'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '1', found: '2'
2 Halted 0 ms 0 KB -