Submission #971770

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
971770	2024-04-29T09:15:25 Z	marvinthang	Tortoise (CEOI21_tortoise)	C++17	0 / 100	1 ms	460 KB

tortoise

/*************************************
*    author: marvinthang             *
*    created: 29.04.2024 15:55:38    *
*************************************/

#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

const int INF = 1e9;

void process(void) {
	int n; cin >> n;
	vector <int> a(n); cin >> a;
	long long res = 0;
	vector <int> left(n, -1), right(n, -1), nxt(n + 1, -1);
	REP(i, n) {
		if (a[i] != -1) {
			res += a[i];
			if (i) left[i] = left[i - 1];
		} else left[i] = i;
	}
	REPD(i, n) {
		nxt[i] = nxt[i + 1];
		if (a[i] == -1) {
			right[i] = i;
		} else {
			if (a[i]) nxt[i] = i;
			if (i + 1 < n) right[i] = right[i + 1];
		}
	}
	long long cur_t = 0;
	priority_queue <int> pq;
	REP(i, n) {
		if (a[i] > 0) {
			int dist = min(left[i] != -1 ? i - left[i] : INF, right[i] != -1 ? right[i] - i : INF) * 2;
			REP(love, a[i] - 1) {
				if (cur_t <= i * 2) {
					cur_t += dist;
					pq.push(dist);
				} else if (pq.top() > dist) {
					cur_t += dist - pq.top();
					pq.pop();
					pq.push(dist);
				} else break;
			}
			if (nxt[i + 1] == -1) dist = 0;
			else if (right[i] != -1) {
				if (nxt[i + 1] < right[i]) dist = min(dist, (right[i] - i - 1) * 2);
				else dist = 0;
			}
			if (cur_t <= i * 2) {
				cur_t += dist;
				pq.push(dist);
			} else if (pq.top() > dist) {
				cur_t += dist - pq.top();
				pq.pop();
				pq.push(dist);
			}
		}
		++cur_t;
	}
	cout << res - (int) pq.size() << '\n';
}

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

Compilation message

tortoise.cpp: In function 'int main()':
tortoise.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
tortoise.cpp:103:2: note: in expansion of macro 'file'
  103 |  file("tortoise");
      |  ^~~~
tortoise.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
tortoise.cpp:103:2: note: in expansion of macro 'file'
  103 |  file("tortoise");
      |  ^~~~

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	460 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Incorrect	1 ms	348 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	460 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Incorrect	1 ms	348 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	460 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Incorrect	1 ms	348 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	460 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Incorrect	1 ms	348 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	460 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Incorrect	1 ms	348 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Submission #971770

Compilation message

Subtask #1 0 / 8.0

Subtask #2 0 / 10.0

Subtask #3 0 / 30.0

Subtask #4 0 / 25.0

Subtask #5 0 / 27.0

Subtask #1
0 / 8.0

Subtask #2
0 / 10.0

Subtask #3
0 / 30.0

Subtask #4
0 / 25.0

Subtask #5
0 / 27.0