| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 887290 | 2023-12-14T08:13:53 Z | fanwen | Fancy Fence (CEOI20_fancyfence) | C++17 | 25 ms | 3276 KB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
using namespace std;
template <int Mod>
struct Modular {
private :
int val;
static int inverse(int a, int b) {
a %= b;
assert(a);
if(a == 1) return 1;
return int(b - (long long) inverse(b, a) * (long long) b / a);
}
public :
Modular(long long x = 0) : val(x % Mod) { if(val < 0) val += Mod; }
friend bool operator == (const Modular &a, const Modular &b) { return a.val == b.val; }
friend bool operator != (const Modular &a, const Modular &b) { return a.val != b.val; }
Modular& operator = (const long long &x) { val = x % Mod; if(val < 0) val += Mod; return *this; }
Modular& operator = (const Modular &x) { val = x.val; return *this; }
friend istream & operator >> (istream &in, Modular &a) { long long x; in >> x; a = Modular(x); return in; }
friend ostream & operator << (ostream &out, const Modular &a) { return out << a.val; }
explicit operator int() const { return val; }
explicit operator bool() const { return val > 0; }
Modular inv() const {
Modular res;
res.val = inverse(val, Mod);
return res;
}
Modular operator ++() { (*this) += 1; return *this; }
Modular operator --() { (*this) -= 1; return *this; }
Modular operator ++(int) { (*this) += 1; return *this - 1; }
Modular operator --(int) { (*this) -= 1; return *this + 1; }
Modular operator + () const { return *this; }
Modular operator - () const {
Modular res;
res.val = (val ? Mod - val : 0);
return res;
}
Modular& operator += (const Modular &a) {
val += a.val;
if(val >= Mod) val -= Mod;
return *this;
}
Modular& operator -= (const Modular &a) {
val -= a.val;
if(val < 0) val += Mod;
return *this;
}
Modular& operator *= (const Modular &a) {
val = 1LL * val * a.val % Mod;
return *this;
}
Modular& operator /= (const Modular &a) {
(*this) *= a.inv();
return *this;
}
friend Modular operator + (const Modular &a, const Modular &b) { return Modular(a) += b; }
friend Modular operator - (const Modular &a, const Modular &b) { return Modular(a) -= b; }
friend Modular operator * (const Modular &a, const Modular &b) { return Modular(a) *= b; }
friend Modular operator / (const Modular &a, const Modular &b) { return Modular(a) /= b; }
};
// const int Mod = 998244353;
// const int Mod = 1e9 + 9; // 1000000009
const int Mod = 1e9 + 7; // 1000000007
using Modint = Modular <Mod>;
template <class T> T pow(T a, long long b) {
T ans = 1, mul = a;
for (; b; b >>= 1) {
if(b & 1LL) ans *= mul;
mul *= mul;
}
return ans;
}
const int MAX = 1e5 + 5;
int n;
pair <int, int> a[MAX];
Modint get(int h, int w) {
return Modint(h) * Modint(h + 1) * Modint(w) * Modint(w + 1) / 4;
}
void you_make_it(void) {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i].fi;
for (int i = 1; i <= n; ++i) cin >> a[i].se;
sort(a + 1, a + n + 1);
Modint ans = 0, sum = 0;
for (int i = 1; i <= n; ++i) {
ans += get(a[i].fi, a[i].se) + a[i].se * sum;
sum += Modint(a[i].fi) * Modint(a[i].fi + 1) / 2 * a[i].se;
}
cout << ans;
}
signed main() {
#ifdef LOCAL
freopen("TASK.inp", "r", stdin);
freopen("TASK.out", "w", stdout);
#endif
file("fancyfence");
auto start_time = chrono::steady_clock::now();
cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
you_make_it();
auto end_time = chrono::steady_clock::now();
cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
// Dream it. Wish it. Do it.
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
| 3 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 468 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
| 3 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1 ms | 344 KB | Output is correct |
| 2 | Correct | 3 ms | 604 KB | Output is correct |
| 3 | Correct | 14 ms | 1624 KB | Output is correct |
| 4 | Correct | 25 ms | 3020 KB | Output is correct |
| 5 | Correct | 25 ms | 3164 KB | Output is correct |
| 6 | Correct | 1 ms | 344 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 600 KB | Output is correct |
| 2 | Correct | 1 ms | 348 KB | Output is correct |
| 3 | Correct | 3 ms | 604 KB | Output is correct |
| 4 | Correct | 13 ms | 1716 KB | Output is correct |
| 5 | Correct | 25 ms | 3156 KB | Output is correct |
| 6 | Correct | 25 ms | 3276 KB | Output is correct |
| 7 | Correct | 0 ms | 600 KB | Output is correct |
| 8 | Correct | 2 ms | 604 KB | Output is correct |
| 9 | Correct | 11 ms | 1612 KB | Output is correct |
| 10 | Correct | 18 ms | 2884 KB | Output is correct |
| 11 | Correct | 19 ms | 3164 KB | Output is correct |
| 12 | Correct | 1 ms | 596 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Incorrect | 1 ms | 344 KB | Output isn't correct |
| 3 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 348 KB | Output is correct |
| 2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
| 3 | Halted | 0 ms | 0 KB | - |