oj.uz

답안 #892843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892843 2023-12-26T04:55:56 Z thunopro 푸드 코트 (JOI21_foodcourt) C++14
7 / 100
 125 ms 148564 KB 
#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#define ll long long
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef vector<ll> vl ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 
typedef pair<ll,ll> pll ;  

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow(a,n/2) ;
	if ( n % 2 ) return (1ll*res*res%mod*a%mod) ; 
	else return 1ll*res*res%mod ; 
}

int n , m , nq ; 

struct shape {
	int op , l , r , c , k ; 
	int pos ; 
	ll b ; 
} q [maxn] ;

deque <pll> deq [maxn] ; 
void sub1 () 
{
	for ( int run = 1 ; run <= nq ; run ++ ) 
	{
		int op = q [run].op ; 
		if ( op <= 2 ) 
		{
			int l = q [run].l , r = q [run].r , c = q [run].c , k = q [run].k ; 
			if ( op == 1 ) 
			{
				for ( int i = l ; i <= r ; i ++ ) 
				{
					if ( deq[i].empty() || deq[i].back().fi != c ) deq[i] . push_back ({c,k}) ; 
					else deq[i].back().se += k ; 
				}
			}
			else 
			{
				for ( int i = l ; i <= r ; i ++ ) 
				{
					int remain = k ; 
					while ( deq[i].size () ) 
					{
						if ( deq[i].front().se <= remain ) remain -= deq[i].front().se , deq[i].pop_front () ; 
						else 
						{
							deq[i].front().se -= remain ; 
							break ; 
						}
					}
				}
			}
		}
		else 
		{
			int pos = q[run].pos ; 
			ll b = q [run].b ; 
			deque <pll> New = deq [pos] ; 
			ll sum = 0 ; 
			
			int res = 0 ; 
			
			while ( !New.empty() ) 
			{
				if ( sum + New.front().se >= b )
				{
					res = New.front().fi ; 
					break ; 
				}
				sum += New.front().se ; 
				New.pop_front() ; 
			}
			
			cout << res << "\n" ; 
		}
	}
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n >> m >> nq ; 
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		cin >> q[i].op ; 
		if ( q[i].op == 1 ) 
		{
			cin >> q[i].l >> q[i].r >> q[i].c >> q[i].k ; 
		}
		else if ( q[i].op == 2 ) 
		{
			cin >> q[i].l >> q[i].r >> q [i].k ; 
		}
		else cin >> q[i].pos >> q[i].b ; 
	}
	
	if ( n <= 2e3 && nq <= 2e3 ) sub1 () ; 
}

Compilation message

foodcourt.cpp: In function 'void rf()':
foodcourt.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 136276 KB Output is correct
2 Correct 77 ms 136780 KB Output is correct
3 Correct 76 ms 143328 KB Output is correct
4 Correct 104 ms 147028 KB Output is correct
5 Correct 65 ms 135996 KB Output is correct
6 Correct 63 ms 135784 KB Output is correct
7 Correct 86 ms 148564 KB Output is correct
8 Correct 81 ms 143952 KB Output is correct
9 Correct 81 ms 136788 KB Output is correct
10 Correct 85 ms 143656 KB Output is correct
11 Correct 80 ms 140824 KB Output is correct
12 Correct 76 ms 136784 KB Output is correct
13 Correct 80 ms 136764 KB Output is correct
14 Correct 82 ms 138068 KB Output is correct
15 Correct 77 ms 138792 KB Output is correct
16 Correct 82 ms 138324 KB Output is correct
17 Correct 72 ms 136272 KB Output is correct
18 Correct 77 ms 136552 KB Output is correct
19 Correct 62 ms 136016 KB Output is correct
20 Correct 62 ms 136024 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 136276 KB Output is correct
2 Correct 77 ms 136780 KB Output is correct
3 Correct 76 ms 143328 KB Output is correct
4 Correct 104 ms 147028 KB Output is correct
5 Correct 65 ms 135996 KB Output is correct
6 Correct 63 ms 135784 KB Output is correct
7 Correct 86 ms 148564 KB Output is correct
8 Correct 81 ms 143952 KB Output is correct
9 Correct 81 ms 136788 KB Output is correct
10 Correct 85 ms 143656 KB Output is correct
11 Correct 80 ms 140824 KB Output is correct
12 Correct 76 ms 136784 KB Output is correct
13 Correct 80 ms 136764 KB Output is correct
14 Correct 82 ms 138068 KB Output is correct
15 Correct 77 ms 138792 KB Output is correct
16 Correct 82 ms 138324 KB Output is correct
17 Correct 72 ms 136272 KB Output is correct
18 Correct 77 ms 136552 KB Output is correct
19 Correct 62 ms 136016 KB Output is correct
20 Correct 62 ms 136024 KB Output is correct
21 Correct 76 ms 136780 KB Output is correct
22 Correct 75 ms 136784 KB Output is correct
23 Correct 81 ms 143412 KB Output is correct
24 Correct 84 ms 147024 KB Output is correct
25 Correct 63 ms 135808 KB Output is correct
26 Correct 69 ms 136020 KB Output is correct
27 Correct 86 ms 147792 KB Output is correct
28 Correct 82 ms 144724 KB Output is correct
29 Correct 78 ms 138576 KB Output is correct
30 Correct 91 ms 143492 KB Output is correct
31 Correct 79 ms 140628 KB Output is correct
32 Correct 79 ms 136712 KB Output is correct
33 Correct 76 ms 137004 KB Output is correct
34 Correct 82 ms 138996 KB Output is correct
35 Correct 79 ms 137432 KB Output is correct
36 Correct 79 ms 138064 KB Output is correct
37 Correct 62 ms 135916 KB Output is correct
38 Correct 62 ms 136224 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 75 ms 139088 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 125 ms 146104 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 136276 KB Output is correct
2 Correct 77 ms 136780 KB Output is correct
3 Correct 76 ms 143328 KB Output is correct
4 Correct 104 ms 147028 KB Output is correct
5 Correct 65 ms 135996 KB Output is correct
6 Correct 63 ms 135784 KB Output is correct
7 Correct 86 ms 148564 KB Output is correct
8 Correct 81 ms 143952 KB Output is correct
9 Correct 81 ms 136788 KB Output is correct
10 Correct 85 ms 143656 KB Output is correct
11 Correct 80 ms 140824 KB Output is correct
12 Correct 76 ms 136784 KB Output is correct
13 Correct 80 ms 136764 KB Output is correct
14 Correct 82 ms 138068 KB Output is correct
15 Correct 77 ms 138792 KB Output is correct
16 Correct 82 ms 138324 KB Output is correct
17 Correct 72 ms 136272 KB Output is correct
18 Correct 77 ms 136552 KB Output is correct
19 Correct 62 ms 136016 KB Output is correct
20 Correct 62 ms 136024 KB Output is correct
21 Incorrect 75 ms 139088 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 76 ms 139460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 136276 KB Output is correct
2 Correct 77 ms 136780 KB Output is correct
3 Correct 76 ms 143328 KB Output is correct
4 Correct 104 ms 147028 KB Output is correct
5 Correct 65 ms 135996 KB Output is correct
6 Correct 63 ms 135784 KB Output is correct
7 Correct 86 ms 148564 KB Output is correct
8 Correct 81 ms 143952 KB Output is correct
9 Correct 81 ms 136788 KB Output is correct
10 Correct 85 ms 143656 KB Output is correct
11 Correct 80 ms 140824 KB Output is correct
12 Correct 76 ms 136784 KB Output is correct
13 Correct 80 ms 136764 KB Output is correct
14 Correct 82 ms 138068 KB Output is correct
15 Correct 77 ms 138792 KB Output is correct
16 Correct 82 ms 138324 KB Output is correct
17 Correct 72 ms 136272 KB Output is correct
18 Correct 77 ms 136552 KB Output is correct
19 Correct 62 ms 136016 KB Output is correct
20 Correct 62 ms 136024 KB Output is correct
21 Correct 76 ms 136780 KB Output is correct
22 Correct 75 ms 136784 KB Output is correct
23 Correct 81 ms 143412 KB Output is correct
24 Correct 84 ms 147024 KB Output is correct
25 Correct 63 ms 135808 KB Output is correct
26 Correct 69 ms 136020 KB Output is correct
27 Correct 86 ms 147792 KB Output is correct
28 Correct 82 ms 144724 KB Output is correct
29 Correct 78 ms 138576 KB Output is correct
30 Correct 91 ms 143492 KB Output is correct
31 Correct 79 ms 140628 KB Output is correct
32 Correct 79 ms 136712 KB Output is correct
33 Correct 76 ms 137004 KB Output is correct
34 Correct 82 ms 138996 KB Output is correct
35 Correct 79 ms 137432 KB Output is correct
36 Correct 79 ms 138064 KB Output is correct
37 Correct 62 ms 135916 KB Output is correct
38 Correct 62 ms 136224 KB Output is correct
39 Incorrect 75 ms 139088 KB Output isn't correct
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 136276 KB Output is correct
2 Correct 77 ms 136780 KB Output is correct
3 Correct 76 ms 143328 KB Output is correct
4 Correct 104 ms 147028 KB Output is correct
5 Correct 65 ms 135996 KB Output is correct
6 Correct 63 ms 135784 KB Output is correct
7 Correct 86 ms 148564 KB Output is correct
8 Correct 81 ms 143952 KB Output is correct
9 Correct 81 ms 136788 KB Output is correct
10 Correct 85 ms 143656 KB Output is correct
11 Correct 80 ms 140824 KB Output is correct
12 Correct 76 ms 136784 KB Output is correct
13 Correct 80 ms 136764 KB Output is correct
14 Correct 82 ms 138068 KB Output is correct
15 Correct 77 ms 138792 KB Output is correct
16 Correct 82 ms 138324 KB Output is correct
17 Correct 72 ms 136272 KB Output is correct
18 Correct 77 ms 136552 KB Output is correct
19 Correct 62 ms 136016 KB Output is correct
20 Correct 62 ms 136024 KB Output is correct
21 Correct 76 ms 136780 KB Output is correct
22 Correct 75 ms 136784 KB Output is correct
23 Correct 81 ms 143412 KB Output is correct
24 Correct 84 ms 147024 KB Output is correct
25 Correct 63 ms 135808 KB Output is correct
26 Correct 69 ms 136020 KB Output is correct
27 Correct 86 ms 147792 KB Output is correct
28 Correct 82 ms 144724 KB Output is correct
29 Correct 78 ms 138576 KB Output is correct
30 Correct 91 ms 143492 KB Output is correct
31 Correct 79 ms 140628 KB Output is correct
32 Correct 79 ms 136712 KB Output is correct
33 Correct 76 ms 137004 KB Output is correct
34 Correct 82 ms 138996 KB Output is correct
35 Correct 79 ms 137432 KB Output is correct
36 Correct 79 ms 138064 KB Output is correct
37 Correct 62 ms 135916 KB Output is correct
38 Correct 62 ms 136224 KB Output is correct
39 Incorrect 75 ms 139088 KB Output isn't correct
40 Halted 0 ms 0 KB -