oj.uz

Submission #815021

# Submission time Handle Problem Language Result Execution time Memory
815021 2023-08-08T11:47:26 Z marvinthang Cell Automaton (JOI23_cell) C++17
16 / 100
 223 ms 43400 KB 
/*************************************
*    author: marvinthang             *
*    created: 08.08.2023 18:39:30    *
*************************************/

#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 << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 1e5 + 5;
const int MAXD = 1023;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

int N, Q;
pair <int, int> points[MAX];

void init(void) {
	cin >> N >> Q;
	REP(i, N) cin >> points[i];
}

namespace SUBTASK_2 {

	int dist[MAXD * 4][MAXD * 4], cnt[MAXD];

	void solve(void) {
		queue <pair <int, int>> q;
		REP(i, N) {
			auto [x, y] = points[i];
			x += MAXD + MAXD;
			y += MAXD + MAXD;
			dist[x][y] = 1;
			q.emplace(x, y);
		}
		while (!q.empty()) {
			auto [x, y] = q.front(); q.pop();
			++cnt[dist[x][y] - 1];
			if (dist[x][y] >= 1001) continue;
			REP(d, 4) {
				int u = x + dx[d];
				int v = y + dy[d];
				if (!dist[u][v]) {
					dist[u][v] = dist[x][y] + 1;
					q.emplace(u, v);
				}
			}
		}
		while (Q--) {
			int t; cin >> t;
			cout << cnt[t] << '\n';
		}
	}

}

void process(void) {
	int max_d = 0;
	REP(i, N) maximize(max_d, max(abs(points[i].fi), abs(points[i].se)));
	if (max_d < MAXD) {
		SUBTASK_2 :: solve();
		return;
	}
}

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

Compilation message

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 16512 KB Output is correct
2 Correct 70 ms 16840 KB Output is correct
3 Correct 60 ms 17832 KB Output is correct
4 Correct 61 ms 18028 KB Output is correct
5 Correct 58 ms 16792 KB Output is correct
6 Correct 68 ms 17032 KB Output is correct
7 Correct 56 ms 17284 KB Output is correct
8 Correct 62 ms 18228 KB Output is correct
9 Correct 63 ms 17988 KB Output is correct
10 Correct 65 ms 17912 KB Output is correct
11 Correct 82 ms 17868 KB Output is correct
12 Correct 61 ms 18164 KB Output is correct
13 Correct 64 ms 18188 KB Output is correct
14 Correct 63 ms 18088 KB Output is correct
15 Correct 68 ms 18128 KB Output is correct
16 Correct 53 ms 16192 KB Output is correct
17 Correct 52 ms 16128 KB Output is correct
18 Correct 53 ms 16204 KB Output is correct
19 Correct 50 ms 16204 KB Output is correct
20 Correct 72 ms 16168 KB Output is correct
21 Correct 53 ms 16260 KB Output is correct
22 Correct 53 ms 16224 KB Output is correct
23 Correct 50 ms 16188 KB Output is correct
24 Correct 49 ms 16156 KB Output is correct
25 Correct 50 ms 16184 KB Output is correct
26 Correct 51 ms 16260 KB Output is correct
27 Correct 52 ms 16236 KB Output is correct
28 Correct 76 ms 16408 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 16512 KB Output is correct
2 Correct 70 ms 16840 KB Output is correct
3 Correct 60 ms 17832 KB Output is correct
4 Correct 61 ms 18028 KB Output is correct
5 Correct 58 ms 16792 KB Output is correct
6 Correct 68 ms 17032 KB Output is correct
7 Correct 56 ms 17284 KB Output is correct
8 Correct 62 ms 18228 KB Output is correct
9 Correct 63 ms 17988 KB Output is correct
10 Correct 65 ms 17912 KB Output is correct
11 Correct 82 ms 17868 KB Output is correct
12 Correct 61 ms 18164 KB Output is correct
13 Correct 64 ms 18188 KB Output is correct
14 Correct 63 ms 18088 KB Output is correct
15 Correct 68 ms 18128 KB Output is correct
16 Correct 53 ms 16192 KB Output is correct
17 Correct 52 ms 16128 KB Output is correct
18 Correct 53 ms 16204 KB Output is correct
19 Correct 50 ms 16204 KB Output is correct
20 Correct 72 ms 16168 KB Output is correct
21 Correct 53 ms 16260 KB Output is correct
22 Correct 53 ms 16224 KB Output is correct
23 Correct 50 ms 16188 KB Output is correct
24 Correct 49 ms 16156 KB Output is correct
25 Correct 50 ms 16184 KB Output is correct
26 Correct 51 ms 16260 KB Output is correct
27 Correct 52 ms 16236 KB Output is correct
28 Correct 76 ms 16408 KB Output is correct
29 Correct 53 ms 16580 KB Output is correct
30 Correct 99 ms 23020 KB Output is correct
31 Correct 174 ms 32648 KB Output is correct
32 Correct 223 ms 42904 KB Output is correct
33 Correct 97 ms 24208 KB Output is correct
34 Correct 113 ms 27764 KB Output is correct
35 Correct 121 ms 28000 KB Output is correct
36 Correct 51 ms 16232 KB Output is correct
37 Correct 52 ms 16176 KB Output is correct
38 Correct 190 ms 39164 KB Output is correct
39 Correct 197 ms 40608 KB Output is correct
40 Correct 223 ms 43400 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 16512 KB Output is correct
2 Correct 70 ms 16840 KB Output is correct
3 Correct 60 ms 17832 KB Output is correct
4 Correct 61 ms 18028 KB Output is correct
5 Correct 58 ms 16792 KB Output is correct
6 Correct 68 ms 17032 KB Output is correct
7 Correct 56 ms 17284 KB Output is correct
8 Correct 62 ms 18228 KB Output is correct
9 Correct 63 ms 17988 KB Output is correct
10 Correct 65 ms 17912 KB Output is correct
11 Correct 82 ms 17868 KB Output is correct
12 Correct 61 ms 18164 KB Output is correct
13 Correct 64 ms 18188 KB Output is correct
14 Correct 63 ms 18088 KB Output is correct
15 Correct 68 ms 18128 KB Output is correct
16 Correct 53 ms 16192 KB Output is correct
17 Correct 52 ms 16128 KB Output is correct
18 Correct 53 ms 16204 KB Output is correct
19 Correct 50 ms 16204 KB Output is correct
20 Correct 72 ms 16168 KB Output is correct
21 Correct 53 ms 16260 KB Output is correct
22 Correct 53 ms 16224 KB Output is correct
23 Correct 50 ms 16188 KB Output is correct
24 Correct 49 ms 16156 KB Output is correct
25 Correct 50 ms 16184 KB Output is correct
26 Correct 51 ms 16260 KB Output is correct
27 Correct 52 ms 16236 KB Output is correct
28 Correct 76 ms 16408 KB Output is correct
29 Correct 53 ms 16580 KB Output is correct
30 Correct 99 ms 23020 KB Output is correct
31 Correct 174 ms 32648 KB Output is correct
32 Correct 223 ms 42904 KB Output is correct
33 Correct 97 ms 24208 KB Output is correct
34 Correct 113 ms 27764 KB Output is correct
35 Correct 121 ms 28000 KB Output is correct
36 Correct 51 ms 16232 KB Output is correct
37 Correct 52 ms 16176 KB Output is correct
38 Correct 190 ms 39164 KB Output is correct
39 Correct 197 ms 40608 KB Output is correct
40 Correct 223 ms 43400 KB Output is correct
41 Incorrect 16 ms 1108 KB Output isn't correct
42 Halted 0 ms 0 KB -