Submission #1034399

#TimeUsernameProblemLanguageResultExecution timeMemory
1034399RecursiveCoFlooding Wall (BOI24_wall)C++17
17 / 100
5033 ms856 KiB
// CF template, version 3.0 #include <bits/stdc++.h> using namespace std; #define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0) #define getTest int t; cin >> t #define eachTest for (int _var=0;_var<t;_var++) #define get(name) int (name); cin >> (name) #define out(o) cout << (o) #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); } #define sortl(name) sort((name).begin(), (name).end()) #define rev(name) reverse((name).begin(), (name).end()) #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++) #define decision(b) if (b){out("YES");}else{out("NO");} #define int long long int template <typename T, typename I> struct segtree { int n; vector<T> tree; vector<I> initial; T id; segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) { tree.resize(4 * n); } T conquer(T left, T right) { // write your conquer function } T value(I inp) { // write your value function } void build(int v, int l, int r) { if (l == r) tree[v] = value(initial[l]); else { int middle = (l + r) / 2; build(2 * v, l, middle); build(2 * v + 1, middle + 1, r); tree[v] = conquer(tree[2 * v], tree[2 * v + 1]); } } void upd(int v, int l, int r, int i, I x) { if (l == r) tree[v] = value(x); else { int middle = (l + r) / 2; if (middle >= i) upd(2 * v, l, middle, i, x); else upd(2 * v + 1, middle + 1, r, i, x); tree[v] = conquer(tree[2 * v], tree[2 * v + 1]); } } T query(int v, int l, int r, int ql, int qr) { if (ql <= l && r <= qr) return tree[v]; else if (r < ql || qr < l) return id; int middle = (l + r) / 2; T left = query(2 * v, l, middle, ql, qr); T right = query(2 * v + 1, middle + 1, r, ql, qr); return conquer(left, right); } }; // vector<int> int mod = 1e9 + 7; signed main() { improvePerformance; //getTest; //eachTest { get(n); getList(n, A); getList(n, B); vector<int> power; power.push_back(1); forto(n + 5, i) power.push_back(power.back() * 2 % mod); int ans = 0; forto(n, i) { vector<int> cands; cands.push_back(A[i]); cands.push_back(B[i]); for (int here: cands) { vector<int> ways(1005, 0); forto(1005, j) { if (here >= j) { ways[j] = power[n - 1]; } else { int left = power[i]; int prod = 1; forto(i, k) { int good = 0; if (A[k] < j) good++; if (B[k] < j) good++; prod = prod * good % mod; } left = (left - prod + mod) % mod; int right = power[n - i - 1]; prod = 1; for (int k = i + 1; k < n; k++) { int good = 0; if (A[k] < j) good++; if (B[k] < j) good++; prod = prod * good % mod; } right = (right - prod + mod) % mod; ways[j] = left * right % mod; } } for (int j = 1; j <= 1000; j++) { int thismax = (ways[j] - ways[j + 1] + mod) % mod; int thismaxsum = here >= j? 0: thismax * (j - here) % mod; ans = (ans + thismaxsum) % mod; } } } out(ans); //} }

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:78:9: note: in expansion of macro 'get'
   78 |         get(n);
      |         ^~~
Main.cpp:12:40: warning: unnecessary parentheses in declaration of 'A' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
Main.cpp:79:9: note: in expansion of macro 'getList'
   79 |         getList(n, A);
      |         ^~~~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
Main.cpp:79:9: note: in expansion of macro 'getList'
   79 |         getList(n, A);
      |         ^~~~~~~
Main.cpp:12:40: warning: unnecessary parentheses in declaration of 'B' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
Main.cpp:80:9: note: in expansion of macro 'getList'
   80 |         getList(n, B);
      |         ^~~~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
Main.cpp:80:9: note: in expansion of macro 'getList'
   80 |         getList(n, B);
      |         ^~~~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:83:9: note: in expansion of macro 'forto'
   83 |         forto(n + 5, i) power.push_back(power.back() * 2 % mod);
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:85:9: note: in expansion of macro 'forto'
   85 |         forto(n, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:91:17: note: in expansion of macro 'forto'
   91 |                 forto(1005, j) {
      |                 ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'k' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:97:25: note: in expansion of macro 'forto'
   97 |                         forto(i, k) {
      |                         ^~~~~
#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...