oj.uz

답안 #887712

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887712 2023-12-15T04:15:54 Z cpptowin Fancy Fence (CEOI20_fancyfence) C++17
100 / 100
 36 ms 13272 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int mod = 1e9 + 7;
int n;
int h[maxn],w[maxn];
int inv[maxn];
int Pow(int a,int n)
{
    int ans = 1;
    for( ; n ; n >>= 1, a = ((a * a) % mod + mod) % mod) if(n & 1)
        {
            ans = ((ans * a) % mod + mod) % mod;
        }
    return ans;
}
int C(int n)
{
    return n % mod * (n - 1) % mod * inv[2] % mod ;
}
int T(int a,int b)
{
    return C(a + 1) * C(b + 1) % mod;
}
int ans;
int done[maxn];
struct DSU
{
    vi par,sz;
    DSU(int n) : par(n),sz(n) {};
    void make(int u)
    {
        par[u] = u;
        sz[u] = 1;
    }
    int find(int u)
    {
        return u == par[u] ? u : par[u] = find(par[u]);
    }
    void Union(int u,int v,int h)
    {
        u = find(u);
        v = find(v);
        if(u == v) return ;
        ans = (ans + T(h,w[u] + w[v]) - T(h,w[u]) - T(h,w[v])) % mod;
        ans = (ans + mod) % mod;
        if(sz[u] < sz[v]) swap(u,v);
        sz[u] += sz[v];
        par[v] = u;
        w[u] = (w[u] + w[v]) % mod;
    }
};
main()
{
#define name "TASK"
    if(fopen(name".inp","r"))
    {
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    inv[2] = Pow(2,mod - 2);
    cin >> n;
    fo(i,1,n) cin >> h[i];
    fo(i,1,n) cin >> w[i];
    DSU g(n + 5);
    fo(i,1,n) g.make(i);
    fo(i,1,n) ans = (ans + T(w[i],h[i])) % mod;
    vi v;
    fo(i,1,n) v.pb(i);
    sort(v.begin(),v.end(),[](int a,int b)
         {
             return h[a] > h[b];
         });
    for(int i : v)
    {
        if(h[i] <= h[i + 1] and done[i + 1])
        {
            g.Union(i,i + 1,h[i]);
        }
        if(h[i] <= h[i - 1] and done[i - 1])
        {
            g.Union(i,i - 1,h[i]);
        }
        done[i] = 1;
    }
    cout << ans;
}

Compilation message

fancyfence.cpp:87:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   87 | main()
      | ^~~~
fancyfence.cpp: In function 'int main()':
fancyfence.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
fancyfence.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 11 ms 8924 KB Output is correct
4 Correct 20 ms 12492 KB Output is correct
5 Correct 20 ms 10820 KB Output is correct
6 Correct 20 ms 10960 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 3 ms 7260 KB Output is correct
3 Correct 12 ms 9272 KB Output is correct
4 Correct 23 ms 11728 KB Output is correct
5 Correct 23 ms 11732 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6640 KB Output is correct
3 Correct 3 ms 7260 KB Output is correct
4 Correct 13 ms 9168 KB Output is correct
5 Correct 28 ms 11668 KB Output is correct
6 Correct 28 ms 11728 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 3 ms 7260 KB Output is correct
9 Correct 13 ms 9328 KB Output is correct
10 Correct 25 ms 13024 KB Output is correct
11 Correct 23 ms 13268 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct

Subtask #6
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6616 KB Output is correct
4 Correct 1 ms 6616 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6488 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6488 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6656 KB Output is correct
15 Correct 1 ms 6644 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 11 ms 8776 KB Output is correct
12 Correct 20 ms 12356 KB Output is correct
13 Correct 20 ms 10968 KB Output is correct
14 Correct 20 ms 10856 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 3 ms 7260 KB Output is correct
17 Correct 12 ms 9180 KB Output is correct
18 Correct 26 ms 11988 KB Output is correct
19 Correct 23 ms 11724 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 4 ms 7256 KB Output is correct
22 Correct 12 ms 9148 KB Output is correct
23 Correct 22 ms 13008 KB Output is correct
24 Correct 26 ms 13120 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 1 ms 6488 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6488 KB Output is correct
30 Correct 4 ms 7260 KB Output is correct
31 Correct 4 ms 7260 KB Output is correct
32 Correct 14 ms 10820 KB Output is correct
33 Correct 15 ms 10968 KB Output is correct
34 Correct 36 ms 13004 KB Output is correct
35 Correct 26 ms 13004 KB Output is correct
36 Correct 35 ms 13252 KB Output is correct
37 Correct 32 ms 13268 KB Output is correct
38 Correct 1 ms 6488 KB Output is correct
39 Correct 30 ms 13272 KB Output is correct
40 Correct 28 ms 13260 KB Output is correct
41 Correct 28 ms 13256 KB Output is correct
42 Correct 27 ms 13264 KB Output is correct