oj.uz

Submission #471177

# Submission time Handle Problem Language Result Execution time Memory
471177 2021-09-07T15:43:09 Z Killer2501 Editor (BOI15_edi) C++14
100 / 100
 263 ms 63032 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define task "tests"
#define pll pair<ll, ll>
#define pi pair<ll, pll>
#define fi first
#define se second

using namespace std;
const ll mod = 1000000000;
const ll N = 3e5+55;
const int base = 313;
ll n, m, t, k, T, ans, q, tong;
ll a[N], b[N], d[N], P[N][20];
vector<ll> adj[N], kq;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}

bool cmp(ll& x, ll& y)
{
    return x > y;
}
bool check(ll x)
{
    ll total = 0;
    for(int i = 1; i <= n; i ++)
    {
        total += b[i] - mod;
        ll j = min(n, (total - x) / mod);
        if(j < 0)continue;
        if(d[j] - mod * i >= x)return true;
    }
    return false;
}
ll jump(ll x, ll mx)
{
    if(b[x] < mx)return x;
    for(int i = 19; i >= 0 ; i --)if(b[P[x][i]] >= mx)x = P[x][i];
    return P[x][0];
}
void sol()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        if(a[i] > 0)
        {
            cout << a[i] << '\n';
            continue;
        }
        b[i] = -a[i];
        P[i][0] = jump(jump(i-1, b[i])-1, b[i]);
        for(int j = 1; j < 20 ; j ++)P[i][j] = P[P[i][j-1]][j-1];
        cout << a[jump(i, 1)] << '\n';
    }
}
int main()
{
    if(fopen(task".in", "r"))
    {
       freopen(task".in", "r", stdin);
       freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}

Compilation message

edi.cpp: In function 'int main()':
edi.cpp:72:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |        freopen(task".in", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
edi.cpp:73:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |        freopen(task".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 6 ms 7884 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 7 ms 8268 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 7 ms 8268 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 7 ms 8268 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 62388 KB Output is correct
2 Correct 145 ms 62312 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 22708 KB Output is correct
2 Correct 85 ms 25716 KB Output is correct
3 Correct 208 ms 50788 KB Output is correct
4 Correct 143 ms 62404 KB Output is correct
5 Correct 147 ms 63032 KB Output is correct
6 Correct 134 ms 60232 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 6 ms 7884 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 7 ms 8268 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 7 ms 8268 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 7 ms 8268 KB Output is correct
10 Correct 146 ms 62388 KB Output is correct
11 Correct 145 ms 62312 KB Output is correct
12 Correct 70 ms 22708 KB Output is correct
13 Correct 85 ms 25716 KB Output is correct
14 Correct 208 ms 50788 KB Output is correct
15 Correct 143 ms 62404 KB Output is correct
16 Correct 147 ms 63032 KB Output is correct
17 Correct 134 ms 60232 KB Output is correct
18 Correct 143 ms 38380 KB Output is correct
19 Correct 139 ms 38232 KB Output is correct
20 Correct 263 ms 61636 KB Output is correct
21 Correct 156 ms 62444 KB Output is correct
22 Correct 156 ms 62988 KB Output is correct