oj.uz

Submission #117105

# Submission time Handle Problem Language Result Execution time Memory
117105 2019-06-14T21:11:44 Z eriksuenderhauf Garage (IOI09_garage) C++11
100 / 100
 3 ms 384 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e4 + 5;
const double eps = 1e-9;
int r[MAXN], w[MAXN], ind[MAXN];

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	nai(r, n);
	nai(w, m);
	set<int> cur;
	for (int i = 0; i < n; i++)
		cur.insert(i);
	deque<int> wa;
	int ans = 0;
	for (int i = 0; i < 2 * m; i++) {
		int nx;
		ni(nx);
		if (nx < 0) {
			nx *= -1;
			nx--;
			cur.insert(ind[nx]);
			if (!wa.empty()) {
				nx = wa.front(); wa.pop_front();
				ind[nx] = *cur.begin();
				cur.erase(cur.begin());
				ans += w[nx] * r[ind[nx]];
			}
		} else {
			nx--;
			if (!cur.empty()) {
				ind[nx] = *cur.begin();
				cur.erase(cur.begin());
				ans += w[nx] * r[ind[nx]];
			} else
				wa.pb(nx);
		}
	}
	pri(ans);
	return 0;
}

Compilation message

garage.cpp: In function 'int main()':
garage.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
garage.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
garage.cpp:11:49: note: in expansion of macro 'ni'
 #define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
                                                 ^~
garage.cpp:42:2: note: in expansion of macro 'nai'
  nai(r, n);
  ^~~
garage.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
garage.cpp:11:49: note: in expansion of macro 'ni'
 #define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
                                                 ^~
garage.cpp:43:2: note: in expansion of macro 'nai'
  nai(w, m);
  ^~~
garage.cpp:9:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define ni(n) scanf("%d", &(n))
               ~~~~~^~~~~~~~~~~~
garage.cpp:51:3: note: in expansion of macro 'ni'
   ni(nx);
   ^~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct