oj.uz

답안 #933630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933630 2024-02-26T02:09:14 Z Neytrino Garage (IOI09_garage) C++14
100 / 100
 3 ms 464 KB 
	/**
	*    author:    inastranets
	*    created:   26.02.2024 01:14:14		
	**/
	#include <bits/stdc++.h>

	using namespace std;

	const int UNDEF = -1;
	const int TAKED = INT_MAX; 

	int main() {
		ios_base::sync_with_stdio(false);
		cin.tie(0);

		int n, m;

		cin >> n >> m;

		vector<int> price(n+1);
		vector<int> weight(m+1);
		vector<int> line(2 * m + 1);
		vector<int> garage(n+1, UNDEF);

		for (int i = 1; i <= n; ++ i) cin >> price[i];
		for (int j = 1; j <= m; ++ j) cin >> weight[j];
		for (int k = 1; k <= 2 * m; ++ k) cin >> line[k];

		long long ans = 0;

		for (int k = 1; k <= 2 * m; ++ k) {
			if (line[k] > 0 && line[k] != TAKED) {
				bool found = false;
				for (int i = 1; i <= n && !found; ++ i) {
					if (garage[i] == UNDEF) {
						garage[i] = line[k];
						ans += price[i] * weight[line[k]];
						found = true;
					} 
				}

				if (!found) {
					int i;
					for (i = k + 1; i <= 2 * m; ++ i) {
						if (line[i] < 0) {	
							break;
						}
					}

					line[i] = -line[i];
					
					for (int j = 1; j <= n; ++ j) {
						if (line[i] == garage[j]) {
							ans += weight[line[k]] * price[j];
							garage[j] = line[k];
							line[i] = TAKED;
							break;
						}
					}
				}

			} else {
				line[k] = -line[k];
				for (int i = 1; i <= n; ++ i) {
					if (line[k] == garage[i]) {
						garage[i] = UNDEF;
						break;
					}
				}	
			}
		}

		cout << ans;
		
		return 0;
	}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct