test/aoj_DSL_2_F.cpp

• View this file on GitHub
• Last update: 2024-06-08 22:59:42+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_F

Depends on

• segtree_lazy(遅延評価セグメント木) (tree/segtree_lazy.cpp)

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_F

#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif

#include "tree/segtree_lazy.cpp"

int main() {
	int N, Q;
	cin >> N >> Q;
	const int in = 2147483647;
	segtree_lazy<int, int> lsg(
		N, [](int l, int r) { return min(l, r); }, [](int x, int m) { return m; },
		[](int l, int r) { return r; }, in, in);

	while(Q--) {
		int mode;
		cin >> mode;
		if(mode == 0) {
			int S, T, X;
			cin >> S >> T >> X;
			lsg.update(S, T + 1, X);
		}
		else {
			int S, T;
			cin >> S >> T;
			cout << lsg.get(S, T + 1) << endl;
		}
	}
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 422, in update
    raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: test/aoj_DSL_2_F.cpp: line 9: found codes out of include guard

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	6 ms	3 MB
g++	00_sample_01.in	AC	5 ms	3 MB
g++	01_rand_00.in	AC	5 ms	3 MB
g++	01_rand_01.in	AC	5 ms	3 MB
g++	01_rand_02.in	AC	6 ms	3 MB
g++	01_rand_03.in	AC	7 ms	3 MB
g++	01_rand_04.in	AC	10 ms	3 MB
g++	01_rand_05.in	AC	18 ms	3 MB
g++	02_corner_00.in	AC	6 ms	3 MB
g++	02_corner_01.in	AC	5 ms	3 MB
g++	03_large_00.in	AC	23 ms	4 MB
g++	03_large_01.in	AC	25 ms	4 MB
g++	03_large_02.in	AC	24 ms	4 MB
g++	03_large_03.in	AC	39 ms	4 MB
g++	04_maximum_00.in	AC	190 ms	5 MB
g++	04_maximum_01.in	AC	182 ms	5 MB
g++	04_maximum_02.in	AC	238 ms	5 MB
g++	04_maximum_03.in	AC	169 ms	5 MB
g++	05_critical_00.in	AC	133 ms	5 MB
g++	05_critical_01.in	AC	205 ms	5 MB
g++	05_critical_02.in	AC	80 ms	5 MB
g++	05_critical_03.in	AC	162 ms	5 MB
clang++	00_sample_00.in	AC	6 ms	3 MB
clang++	00_sample_01.in	AC	6 ms	3 MB
clang++	01_rand_00.in	AC	6 ms	3 MB
clang++	01_rand_01.in	AC	6 ms	3 MB
clang++	01_rand_02.in	AC	6 ms	3 MB
clang++	01_rand_03.in	AC	7 ms	3 MB
clang++	01_rand_04.in	AC	8 ms	3 MB
clang++	01_rand_05.in	AC	18 ms	3 MB
clang++	02_corner_00.in	AC	6 ms	3 MB
clang++	02_corner_01.in	AC	6 ms	3 MB
clang++	03_large_00.in	AC	24 ms	4 MB
clang++	03_large_01.in	AC	26 ms	4 MB
clang++	03_large_02.in	AC	36 ms	4 MB
clang++	03_large_03.in	AC	25 ms	4 MB
clang++	04_maximum_00.in	AC	169 ms	5 MB
clang++	04_maximum_01.in	AC	189 ms	5 MB
clang++	04_maximum_02.in	AC	208 ms	5 MB
clang++	04_maximum_03.in	AC	223 ms	5 MB
clang++	05_critical_00.in	AC	150 ms	5 MB
clang++	05_critical_01.in	AC	163 ms	5 MB
clang++	05_critical_02.in	AC	83 ms	5 MB
clang++	05_critical_03.in	AC	162 ms	5 MB

Back to top page