Submission #991335

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
9913352024-06-02 05:35:01gmroh06즐거운 사진 수집 (JOI13_collecting)C++14
100 / 100
808 ms78420 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
inline void fastio() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
}
ll n, q, MAX;
ll row_tree[1 << 21], col_tree[1 << 21];
ll row[21], col[21];
void update(ll* tree, ll* cnt, ll loc) {
loc |= MAX;
tree[loc] ^= 1;
ll d = n;
while (loc > 1) {
loc >>= 1, d--;
if (tree[loc] % (1LL << n - d) == 0) cnt[d]--;
tree[loc] = tree[loc << 1] + tree[loc << 1 | 1];
if (tree[loc] % (1LL << n - d) == 0) cnt[d]++;
}
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

collecting.cpp: In function 'void update(ll*, ll*, ll)':
collecting.cpp:24:35: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   24 |         if (tree[loc] % (1LL << n - d) == 0) cnt[d]--;
      |                                 ~~^~~
collecting.cpp:28:35: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   28 |         if (tree[loc] % (1LL << n - d) == 0) cnt[d]++;
      |                                 ~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...