oj.uz

답안 #815059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
815059 2023-08-08T12:05:26 Z marvinthang Cell Automaton (JOI23_cell) C++17
16 / 100
 243 ms 43444 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];

	bool checkSub(void) {
		REP(i, N) if (abs(points[i].fi) >= MAXD || abs(points[i].se) >= MAXD) return false;
		return true;
	}

	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';
		}
	}

}

namespace SUBTASK_4 {

	bool checkSub(void) {
		REP(i, N) if (points[i].fi != points[i].se) return false;
		return true;
	}

	void solve(void) {
		sort(points, points + N);
		while (Q--) {
			int t; cin >> t;
			long long res = 0;
			REP(i, N) {
				int j = i;
				int cnt = 2;
				for (; j + 1 < N && points[j + 1].fi - points[j].fi <= t; ++j)
					cnt += points[j + 1].fi - points[j].fi == t;
				res += 1LL * cnt * (t - 1);
				res += (points[j].fi - points[i].fi + t + 1) * 2;
				i = j;
			}
			cout << res << '\n';
		}
	}

}

void process(void) {
	if (SUBTASK_2 :: checkSub()) {
		SUBTASK_2 :: solve();
		return;
	}
	if (SUBTASK_4 :: checkSub()) {
		SUBTASK_4 :: 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:139:2: note: in expansion of macro 'file'
  139 |  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:139:2: note: in expansion of macro 'file'
  139 |  file("cell");
      |  ^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 16500 KB Output is correct
2 Correct 51 ms 16872 KB Output is correct
3 Correct 58 ms 17860 KB Output is correct
4 Correct 57 ms 17924 KB Output is correct
5 Correct 72 ms 16752 KB Output is correct
6 Correct 55 ms 17044 KB Output is correct
7 Correct 56 ms 17356 KB Output is correct
8 Correct 72 ms 18292 KB Output is correct
9 Correct 58 ms 17996 KB Output is correct
10 Correct 67 ms 17900 KB Output is correct
11 Correct 60 ms 17844 KB Output is correct
12 Correct 72 ms 18096 KB Output is correct
13 Correct 57 ms 18136 KB Output is correct
14 Correct 58 ms 18168 KB Output is correct
15 Correct 60 ms 18120 KB Output is correct
16 Correct 70 ms 16128 KB Output is correct
17 Correct 57 ms 16200 KB Output is correct
18 Correct 49 ms 16240 KB Output is correct
19 Correct 51 ms 16252 KB Output is correct
20 Correct 48 ms 16204 KB Output is correct
21 Correct 51 ms 16268 KB Output is correct
22 Correct 48 ms 16196 KB Output is correct
23 Correct 47 ms 16244 KB Output is correct
24 Correct 70 ms 16216 KB Output is correct
25 Correct 47 ms 16172 KB Output is correct
26 Correct 48 ms 16196 KB Output is correct
27 Correct 74 ms 16168 KB Output is correct
28 Correct 48 ms 16188 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 16500 KB Output is correct
2 Correct 51 ms 16872 KB Output is correct
3 Correct 58 ms 17860 KB Output is correct
4 Correct 57 ms 17924 KB Output is correct
5 Correct 72 ms 16752 KB Output is correct
6 Correct 55 ms 17044 KB Output is correct
7 Correct 56 ms 17356 KB Output is correct
8 Correct 72 ms 18292 KB Output is correct
9 Correct 58 ms 17996 KB Output is correct
10 Correct 67 ms 17900 KB Output is correct
11 Correct 60 ms 17844 KB Output is correct
12 Correct 72 ms 18096 KB Output is correct
13 Correct 57 ms 18136 KB Output is correct
14 Correct 58 ms 18168 KB Output is correct
15 Correct 60 ms 18120 KB Output is correct
16 Correct 70 ms 16128 KB Output is correct
17 Correct 57 ms 16200 KB Output is correct
18 Correct 49 ms 16240 KB Output is correct
19 Correct 51 ms 16252 KB Output is correct
20 Correct 48 ms 16204 KB Output is correct
21 Correct 51 ms 16268 KB Output is correct
22 Correct 48 ms 16196 KB Output is correct
23 Correct 47 ms 16244 KB Output is correct
24 Correct 70 ms 16216 KB Output is correct
25 Correct 47 ms 16172 KB Output is correct
26 Correct 48 ms 16196 KB Output is correct
27 Correct 74 ms 16168 KB Output is correct
28 Correct 48 ms 16188 KB Output is correct
29 Correct 67 ms 16512 KB Output is correct
30 Correct 85 ms 23112 KB Output is correct
31 Correct 176 ms 32632 KB Output is correct
32 Correct 229 ms 42960 KB Output is correct
33 Correct 91 ms 24116 KB Output is correct
34 Correct 121 ms 27768 KB Output is correct
35 Correct 137 ms 28060 KB Output is correct
36 Correct 58 ms 16144 KB Output is correct
37 Correct 58 ms 16144 KB Output is correct
38 Correct 187 ms 39156 KB Output is correct
39 Correct 188 ms 40652 KB Output is correct
40 Correct 243 ms 43444 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 1008 KB Output is correct
2 Correct 24 ms 1108 KB Output is correct
3 Correct 24 ms 1108 KB Output is correct
4 Correct 24 ms 1068 KB Output is correct
5 Correct 24 ms 1112 KB Output is correct
6 Correct 24 ms 1028 KB Output is correct
7 Correct 24 ms 1088 KB Output is correct
8 Correct 55 ms 16172 KB Output is correct
9 Correct 50 ms 16248 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 1008 KB Output is correct
2 Correct 24 ms 1108 KB Output is correct
3 Correct 24 ms 1108 KB Output is correct
4 Correct 24 ms 1068 KB Output is correct
5 Correct 24 ms 1112 KB Output is correct
6 Correct 24 ms 1028 KB Output is correct
7 Correct 24 ms 1088 KB Output is correct
8 Correct 55 ms 16172 KB Output is correct
9 Correct 50 ms 16248 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 16500 KB Output is correct
2 Correct 51 ms 16872 KB Output is correct
3 Correct 58 ms 17860 KB Output is correct
4 Correct 57 ms 17924 KB Output is correct
5 Correct 72 ms 16752 KB Output is correct
6 Correct 55 ms 17044 KB Output is correct
7 Correct 56 ms 17356 KB Output is correct
8 Correct 72 ms 18292 KB Output is correct
9 Correct 58 ms 17996 KB Output is correct
10 Correct 67 ms 17900 KB Output is correct
11 Correct 60 ms 17844 KB Output is correct
12 Correct 72 ms 18096 KB Output is correct
13 Correct 57 ms 18136 KB Output is correct
14 Correct 58 ms 18168 KB Output is correct
15 Correct 60 ms 18120 KB Output is correct
16 Correct 70 ms 16128 KB Output is correct
17 Correct 57 ms 16200 KB Output is correct
18 Correct 49 ms 16240 KB Output is correct
19 Correct 51 ms 16252 KB Output is correct
20 Correct 48 ms 16204 KB Output is correct
21 Correct 51 ms 16268 KB Output is correct
22 Correct 48 ms 16196 KB Output is correct
23 Correct 47 ms 16244 KB Output is correct
24 Correct 70 ms 16216 KB Output is correct
25 Correct 47 ms 16172 KB Output is correct
26 Correct 48 ms 16196 KB Output is correct
27 Correct 74 ms 16168 KB Output is correct
28 Correct 48 ms 16188 KB Output is correct
29 Correct 67 ms 16512 KB Output is correct
30 Correct 85 ms 23112 KB Output is correct
31 Correct 176 ms 32632 KB Output is correct
32 Correct 229 ms 42960 KB Output is correct
33 Correct 91 ms 24116 KB Output is correct
34 Correct 121 ms 27768 KB Output is correct
35 Correct 137 ms 28060 KB Output is correct
36 Correct 58 ms 16144 KB Output is correct
37 Correct 58 ms 16144 KB Output is correct
38 Correct 187 ms 39156 KB Output is correct
39 Correct 188 ms 40652 KB Output is correct
40 Correct 243 ms 43444 KB Output is correct
41 Correct 24 ms 1008 KB Output is correct
42 Correct 24 ms 1108 KB Output is correct
43 Correct 24 ms 1108 KB Output is correct
44 Correct 24 ms 1068 KB Output is correct
45 Correct 24 ms 1112 KB Output is correct
46 Correct 24 ms 1028 KB Output is correct
47 Correct 24 ms 1088 KB Output is correct
48 Correct 55 ms 16172 KB Output is correct
49 Correct 50 ms 16248 KB Output is correct
50 Incorrect 1 ms 340 KB Output isn't correct
51 Halted 0 ms 0 KB -