oj.uz

답안 #165310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165310 2019-11-26T11:23:28 Z egekabas Relativnost (COCI15_relativnost) C++14
84 / 140
 4000 ms 37868 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll n, c, q, mod = 10007;
ll a[100009];
ll b[100009];
ll seg[400009][25];

void merge(ll v){
    for(ll i = 0; i <= c; ++i)
        seg[v][i] = 0;
    for(ll i = 0; i <= c; ++i)
        for(ll j = 0; j <= c; ++j){
            seg[v][min(c, i+j)] += seg[2*v][i]*seg[2*v+1][j];
            seg[v][min(c, i+j)] %= mod;        
        }
}
void modify(ll p) {
    seg[p+n][0] = b[p]%mod;
    seg[p+n][1] = a[p]%mod;
    p += n;
    for (; p > 1; p /= 2){
        merge(p/2);       
    }
}
int main() {
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    scanf("%lld %lld", &n, &c);
    
    for(ll i = 0; i < n; ++i)
        scanf("%lld", &a[i]);
    for(ll i = 0; i < n; ++i)
        scanf("%lld", &b[i]);
    for(ll i = 0; i < n; ++i){
        seg[i+n][0] = b[i]%mod;
        seg[i+n][1] = a[i]%mod;
    }
    for(ll i = n-1; i >= 1; --i)
        merge(i);
    scanf("%lld", &q);
    while(q--){
        ll t1;
        scanf("%lld", &t1);
        --t1;
        scanf("%lld %lld", &a[t1], &b[t1]);
        
        modify(t1);
        printf("%lld\n", seg[1][c]);
    }
}

Compilation message

relativnost.cpp: In function 'int main()':
relativnost.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &n, &c);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~
relativnost.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &a[i]);
         ~~~~~^~~~~~~~~~~~~~~
relativnost.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &b[i]);
         ~~~~~^~~~~~~~~~~~~~~
relativnost.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &q);
     ~~~~~^~~~~~~~~~~~
relativnost.cpp:56:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &t1);
         ~~~~~^~~~~~~~~~~~~
relativnost.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld", &a[t1], &b[t1]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
84.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 760 KB Output is correct
2 Correct 44 ms 632 KB Output is correct
3 Correct 85 ms 632 KB Output is correct
4 Correct 1331 ms 22196 KB Output is correct
5 Execution timed out 4086 ms 35752 KB Time limit exceeded
6 Execution timed out 4019 ms 37868 KB Time limit exceeded
7 Correct 3208 ms 26532 KB Output is correct
8 Runtime error 1540 ms 37620 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
9 Correct 2980 ms 30976 KB Output is correct
10 Execution timed out 4046 ms 29360 KB Time limit exceeded