oj.uz

Submission #1065356

# Submission time Handle Problem Language Result Execution time Memory
1065356 2024-08-19T06:36:18 Z 김은성(#11116) Food Court (JOI21_foodcourt) C++17
2 / 100
 1000 ms 331160 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 3.1557e18;
ll mn[1<<19], mn2[1<<19], lazy[1<<19];
void mergenode(int v){
	if(mn[2*v] < mn[2*v+1]){
		mn[v] = mn[2*v];
		mn2[v] = min(mn2[2*v], mn[2*v+1]);
	}
	else if(mn[2*v] > mn[2*v+1]){
		mn[v] = mn[2*v+1];
		mn2[v] = min(mn2[2*v+1], mn[2*v]);
	}
	else{
		mn[v] = mn[2*v];
		mn2[v] = min(mn2[2*v], mn2[2*v+1]);
	}
}
void propagate_lazy(int v, ll val){
	lazy[2*v] += val;
	lazy[2*v+1] += val;
}
void dolazy(int v, bool op){
	//assert(mn[v] < mn2[v]);
	mn[v] = max(mn[v] + lazy[v], 0ll);
	mn2[v] += lazy[v];
	if(!op)
		propagate_lazy(v, lazy[v]);
	lazy[v] = 0;
}
void update(int v, int l, int r, int s, int e, ll d){
	dolazy(v, l==r);
	if(e<l || r<s)
		return;
	if(s<=l && r<=e){
		if(l==r){
			mn[v] = max(mn[v] + d, 0ll);
			mn2[v] = INF;
			return;
		}
		/*
		else if(mn[v] > -d){
			mn[v] += d;
			mn2[v] += d;
			propagate_lazy(v, d);
			return;
		}
		*/
		/*
		else if(mn2[v] > -d){
			mn[v] = 0;
			mn2[v] += d;
			propagate_lazy(v, d);
			return;
		}*/
	}
	int mid = (l+r)/2;
	update(2*v, l, mid, s, e, d);
	update(2*v+1, mid+1, r, s, e, d);
	mergenode(v);
}
ll pointvalue(int v, int l, int r, int idx){
	dolazy(v, l==r);
	if(l==r)
		return mn[v];
	int mid = (l+r)/2;
	if(idx <= mid)
		return pointvalue(2*v, l, mid, idx);
	return pointvalue(2*v+1, mid+1, r, idx);
}
int main(){
	int n, m, q, i, t, type, l, r, c, a;
	ll k, b;
	scanf("%d %d %d", &n, &m, &q);
	//assert(m==1);
	memset(mn2, 63, sizeof(mn2));
	deque<int> qa[(const int)(n+1)];
	for(t=1; t<=q; t++){
		scanf("%d", &type);
		if(type==1){
			scanf("%d %d %d %lld", &l, &r, &c, &k);
			for(i=l; i<=r; i++)
				qa[i].push_back(c);
			update(1, 1, n, l, r, k);
		}
		else if(type==2){
			scanf("%d %d %lld", &l, &r, &k);
			for(i=l; i<=r; i++){
				if(!qa[i].empty())
				qa[i].pop_front();
			}
			update(1, 1, n, l, r, -k);
		}
		else{
			scanf("%d %lld", &a, &b);
			if(pointvalue(1, 1, n, a) >= b){
				printf("%d\n", qa[a][b-1]);
			}
			else
				printf("0\n");
		}
	}
	return 0;
}

Compilation message

foodcourt.cpp: In function 'int main()':
foodcourt.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |  scanf("%d %d %d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:80:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |   scanf("%d", &type);
      |   ~~~~~^~~~~~~~~~~~~
foodcourt.cpp:82:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |    scanf("%d %d %d %lld", &l, &r, &c, &k);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:88:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |    scanf("%d %d %lld", &l, &r, &k);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:96:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |    scanf("%d %lld", &a, &b);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5724 KB Output is correct
2 Correct 16 ms 6380 KB Output is correct
3 Correct 17 ms 7516 KB Output is correct
4 Correct 25 ms 8540 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 27 ms 8540 KB Output is correct
8 Correct 26 ms 8028 KB Output is correct
9 Correct 26 ms 6232 KB Output is correct
10 Correct 28 ms 7772 KB Output is correct
11 Correct 28 ms 7260 KB Output is correct
12 Correct 28 ms 6236 KB Output is correct
13 Correct 30 ms 6748 KB Output is correct
14 Correct 42 ms 7000 KB Output is correct
15 Correct 30 ms 6748 KB Output is correct
16 Correct 42 ms 6748 KB Output is correct
17 Correct 15 ms 5468 KB Output is correct
18 Correct 23 ms 6000 KB Output is correct
19 Correct 3 ms 5468 KB Output is correct
20 Correct 4 ms 5976 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5724 KB Output is correct
2 Correct 16 ms 6380 KB Output is correct
3 Correct 17 ms 7516 KB Output is correct
4 Correct 25 ms 8540 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 27 ms 8540 KB Output is correct
8 Correct 26 ms 8028 KB Output is correct
9 Correct 26 ms 6232 KB Output is correct
10 Correct 28 ms 7772 KB Output is correct
11 Correct 28 ms 7260 KB Output is correct
12 Correct 28 ms 6236 KB Output is correct
13 Correct 30 ms 6748 KB Output is correct
14 Correct 42 ms 7000 KB Output is correct
15 Correct 30 ms 6748 KB Output is correct
16 Correct 42 ms 6748 KB Output is correct
17 Correct 15 ms 5468 KB Output is correct
18 Correct 23 ms 6000 KB Output is correct
19 Correct 3 ms 5468 KB Output is correct
20 Correct 4 ms 5976 KB Output is correct
21 Runtime error 7 ms 11352 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1044 ms 50232 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 212 ms 331160 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5724 KB Output is correct
2 Correct 16 ms 6380 KB Output is correct
3 Correct 17 ms 7516 KB Output is correct
4 Correct 25 ms 8540 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 27 ms 8540 KB Output is correct
8 Correct 26 ms 8028 KB Output is correct
9 Correct 26 ms 6232 KB Output is correct
10 Correct 28 ms 7772 KB Output is correct
11 Correct 28 ms 7260 KB Output is correct
12 Correct 28 ms 6236 KB Output is correct
13 Correct 30 ms 6748 KB Output is correct
14 Correct 42 ms 7000 KB Output is correct
15 Correct 30 ms 6748 KB Output is correct
16 Correct 42 ms 6748 KB Output is correct
17 Correct 15 ms 5468 KB Output is correct
18 Correct 23 ms 6000 KB Output is correct
19 Correct 3 ms 5468 KB Output is correct
20 Correct 4 ms 5976 KB Output is correct
21 Execution timed out 1044 ms 50232 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 68 ms 98388 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5724 KB Output is correct
2 Correct 16 ms 6380 KB Output is correct
3 Correct 17 ms 7516 KB Output is correct
4 Correct 25 ms 8540 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 27 ms 8540 KB Output is correct
8 Correct 26 ms 8028 KB Output is correct
9 Correct 26 ms 6232 KB Output is correct
10 Correct 28 ms 7772 KB Output is correct
11 Correct 28 ms 7260 KB Output is correct
12 Correct 28 ms 6236 KB Output is correct
13 Correct 30 ms 6748 KB Output is correct
14 Correct 42 ms 7000 KB Output is correct
15 Correct 30 ms 6748 KB Output is correct
16 Correct 42 ms 6748 KB Output is correct
17 Correct 15 ms 5468 KB Output is correct
18 Correct 23 ms 6000 KB Output is correct
19 Correct 3 ms 5468 KB Output is correct
20 Correct 4 ms 5976 KB Output is correct
21 Runtime error 7 ms 11352 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5724 KB Output is correct
2 Correct 16 ms 6380 KB Output is correct
3 Correct 17 ms 7516 KB Output is correct
4 Correct 25 ms 8540 KB Output is correct
5 Correct 3 ms 4440 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 27 ms 8540 KB Output is correct
8 Correct 26 ms 8028 KB Output is correct
9 Correct 26 ms 6232 KB Output is correct
10 Correct 28 ms 7772 KB Output is correct
11 Correct 28 ms 7260 KB Output is correct
12 Correct 28 ms 6236 KB Output is correct
13 Correct 30 ms 6748 KB Output is correct
14 Correct 42 ms 7000 KB Output is correct
15 Correct 30 ms 6748 KB Output is correct
16 Correct 42 ms 6748 KB Output is correct
17 Correct 15 ms 5468 KB Output is correct
18 Correct 23 ms 6000 KB Output is correct
19 Correct 3 ms 5468 KB Output is correct
20 Correct 4 ms 5976 KB Output is correct
21 Runtime error 7 ms 11352 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -