Submission #815102

#TimeUsernameProblemLanguageResultExecution timeMemory
815102marvinthangCell Automaton (JOI23_cell)C++17
24 / 100
227 ms43484 KiB
/************************************* * 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 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 { static const int MAXD = 1023; 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); vector <int> diff(N - 1); REP(i, N - 1) diff[i] = points[i + 1].fi - points[i].fi; sort(ALL(diff)); int ptr = 0; long long sum_diff = 0; while (Q--) { int t; cin >> t; if (!t) { cout << N << '\n'; continue; } while (ptr < N - 1 && diff[ptr] < t) sum_diff += diff[ptr++]; int r_ptr = ptr; while (r_ptr < N - 1 && diff[r_ptr] == t) sum_diff += diff[r_ptr++]; long long res = 0; res += 1LL * (r_ptr - ptr) * (t - 1); res += sum_diff * 2; res += 4LL * t * (N - r_ptr); cout << res << '\n'; ptr = r_ptr; } } } 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 (stderr)

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:146:2: note: in expansion of macro 'file'
  146 |  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:146:2: note: in expansion of macro 'file'
  146 |  file("cell");
      |  ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...