oj.uz

Submission #892812

# Submission time Handle Problem Language Result Execution time Memory
892812 2023-12-26T03:10:47 Z marvinthang Ants and Sugar (JOI22_sugar) C++17
6 / 100
 4000 ms 5292 KB 
/*************************************
*    author: marvinthang             *
*    created: 26.12.2023 10:02:55    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int q, l; cin >> q >> l;
	vector <pair <int, int>> sugar_cubes, ants;
	ants.emplace_back((int) 1e9 + 1, 0);
	while (q--) {
		int t, x, a; cin >> t >> x >> a;
		if (t == 1) {
			ants.insert(lower_bound(ALL(ants), pair{x, a}), pair{x, a});
		} else {
			sugar_cubes.insert(lower_bound(ALL(sugar_cubes), pair{x, a}), pair{x, a});
		}
		if (ants.empty()) {
			cout << "0\n";
			continue;
		}
		int i = 0, cnt = ants[0].se;
		long long res = 0;
		for (auto [x, a]: sugar_cubes) {
			while (i + 1 < (int) ants.size() && x - ants[i].fi > l) cnt = ants[++i].se;
			while (i + 1 < (int) ants.size() && abs(ants[i].fi - x) <= l) {
				res += min(cnt, a);
				if (a < cnt) {
					cnt -= a;
					break;
				} else {
					a -= cnt;
					cnt = ants[++i].se;
				}
			}
		}
		cout << res << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI22_sugar");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

sugar.cpp: In function 'int main()':
sugar.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sugar.cpp:81:2: note: in expansion of macro 'file'
   81 |  file("JOI22_sugar");
      |  ^~~~
sugar.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sugar.cpp:81:2: note: in expansion of macro 'file'
   81 |  file("JOI22_sugar");
      |  ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 5 ms 520 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 13 ms 604 KB Output is correct
12 Correct 14 ms 600 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 12 ms 604 KB Output is correct
16 Correct 7 ms 604 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 580 KB Output is correct
19 Correct 12 ms 464 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 13 ms 424 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 15 ms 584 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 15 ms 580 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 4075 ms 2392 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 4078 ms 5292 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 5 ms 520 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 13 ms 604 KB Output is correct
12 Correct 14 ms 600 KB Output is correct
13 Correct 14 ms 604 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 12 ms 604 KB Output is correct
16 Correct 7 ms 604 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 580 KB Output is correct
19 Correct 12 ms 464 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 13 ms 424 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 15 ms 584 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 15 ms 580 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Execution timed out 4075 ms 2392 KB Time limit exceeded
30 Halted 0 ms 0 KB -