oj.uz

Submission #209483

# Submission time Handle Problem Language Result Execution time Memory
209483 2020-03-14T10:48:40 Z Nucleist Xylophone (JOI18_xylophone) C++14
100 / 100
 75 ms 928 KB 
#include <bits/stdc++.h> 
#include "xylophone.h"
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
vector<int>sol;
set<int>nowi;
map<pair<int,int>,int>gg;
void solve(int n)
{
	//debug(n);
    int low=1,high=n-1;
    int lo=1;
    sol.resize(n+1,0);
    while(low<=high)
    {
        int med=(low+high)/2;
        //debug(med);
        int k=query(med,n);
        if(k==(n-1))
        {
            lo=med;
            low=med+1;
        }
        else 
        {
            high=med-1;
        }
    }
    //debug(lo);
    answer(lo,1);
    sol[lo]=1;
    //debug(lo);
    if(lo!=1)
    {int yo=query(lo-1,lo);
    //debug(yo);
    gg[{lo-1,lo}]=yo;
    sol[lo-1]=yo+1;
    answer(lo-1,sol[lo-1]);
    nowi.insert(sol[lo-1]);
    //debug(sol[lo-1]);
	}
    if(lo!=n)
    {int yo=query(lo,lo+1);
    gg[{lo,lo+1}]=yo;
    sol[lo+1]=yo+1;
    answer(lo+1,sol[lo+1]);
    nowi.insert(sol[lo+1]);
    //debug(sol[lo+1]);
	}
    nowi.insert(sol[lo]);    
    for (int i = lo-2; i > 0; --i)
    {
        int z1=0,z2=0,z3=0;
        
        int na=query(i,i+1);
        gg[{i,i+1}]=na;
        
        z1=sol[i+1]-na;
        z2=sol[i+1]+na;
        if(z1<1 || nowi.find(z1)!=nowi.end())
        {
            nowi.insert(z2);
            sol[i]=z2;
            //debugs(i,z2);
            answer(i,z2);
        }
        else if(z2>n || nowi.find(z2)!=nowi.end())
        {
            nowi.insert(z1);
            sol[i]=z1;
            answer(i,z1);
        }
        else
        {
            if(sol[i+2]<sol[i+1])
            {
                if(z1<sol[i+2])
                {
                    if(query(i,i+2)==gg[{i,i+1}])
                    {
                        z3=z1;
                    }
                    else z3=z2;
                }
                else
                {
                    if(query(i,i+2)==gg[{i+1,i+2}])
                    {
                        z3=z1;
                    }
                    else z3=z2;
                }
            }
            else
            {
               if(z2>sol[i+2])
                {
                    if(query(i,i+2)==gg[{i,i+1}])
                    {
                        z3=z2;
                    }
                    else z3=z1;
                }
                else
                {
                    if(query(i,i+2)==gg[{i+1,i+2}])
                    {
                        z3=z2;
                    }
                    else z3=z1;
                } 
            }
            sol[i]=z3;
            nowi.insert(z3);
            answer(i,z3);
        }
    }

    for (int i = lo+2; i <= n; ++i)
    {
        int z1=0,z2=0,z3=0;
        
        int na=query(i-1,i);
        gg[{i-1,i}]=na;
        
        z1=sol[i-1]-na;
        z2=sol[i-1]+na;

        if(z1<1 || nowi.find(z1)!=nowi.end())
        {
            nowi.insert(z2);
            sol[i]=z2;
            answer(i,z2);
        }
        else if(z2>n || nowi.find(z2)!=nowi.end())
        {
            nowi.insert(z1);
            sol[i]=z1;
            answer(i,z1);
        }
        else
        {
            if(sol[i-2]<sol[i-1])
            {
                if(z1<sol[i-2])
                {
                    if(query(i-2,i)==gg[{i-1,i}])
                    {
                        z3=z1;
                    }
                    else z3=z2;
                }
                else
                {
                    if(query(i-2,i)==gg[{i-2,i-1}])
                    {
                        z3=z1;
                    }
                    else z3=z2;
                }
            }
            else
            {
               if(z2>sol[i-2])
                {
                    if(query(i-2,i)==gg[{i-1,i}])
                    {
                        z3=z2;
                    }
                    else z3=z1;
                }
                else
                {
                    if(query(i-2,i)==gg[{i-2,i-1}])
                    {
                        z3=z2;
                    }
                    else z3=z1;
                } 
            }
            sol[i]=z3;
            nowi.insert(z3);
            answer(i,z3);
        }
    }
}
//code the AC sol !
// BS/queue/map

Compilation message

xylophone.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
xylophone.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 9 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 6 ms 308 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 248 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 9 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 6 ms 308 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 248 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 10 ms 376 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 11 ms 348 KB Output is correct
20 Correct 17 ms 504 KB Output is correct
21 Correct 18 ms 376 KB Output is correct
22 Correct 11 ms 328 KB Output is correct
23 Correct 14 ms 376 KB Output is correct
24 Correct 14 ms 376 KB Output is correct
25 Correct 15 ms 376 KB Output is correct
26 Correct 17 ms 504 KB Output is correct
27 Correct 16 ms 504 KB Output is correct
28 Correct 20 ms 376 KB Output is correct
29 Correct 19 ms 376 KB Output is correct
30 Correct 18 ms 504 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 376 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 9 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 6 ms 308 KB Output is correct
14 Correct 6 ms 376 KB Output is correct
15 Correct 6 ms 248 KB Output is correct
16 Correct 7 ms 376 KB Output is correct
17 Correct 10 ms 376 KB Output is correct
18 Correct 19 ms 376 KB Output is correct
19 Correct 11 ms 348 KB Output is correct
20 Correct 17 ms 504 KB Output is correct
21 Correct 18 ms 376 KB Output is correct
22 Correct 11 ms 328 KB Output is correct
23 Correct 14 ms 376 KB Output is correct
24 Correct 14 ms 376 KB Output is correct
25 Correct 15 ms 376 KB Output is correct
26 Correct 17 ms 504 KB Output is correct
27 Correct 16 ms 504 KB Output is correct
28 Correct 20 ms 376 KB Output is correct
29 Correct 19 ms 376 KB Output is correct
30 Correct 18 ms 504 KB Output is correct
31 Correct 33 ms 504 KB Output is correct
32 Correct 43 ms 652 KB Output is correct
33 Correct 61 ms 760 KB Output is correct
34 Correct 69 ms 816 KB Output is correct
35 Correct 73 ms 816 KB Output is correct
36 Correct 59 ms 836 KB Output is correct
37 Correct 57 ms 888 KB Output is correct
38 Correct 58 ms 872 KB Output is correct
39 Correct 75 ms 888 KB Output is correct
40 Correct 69 ms 892 KB Output is correct
41 Correct 61 ms 760 KB Output is correct
42 Correct 56 ms 760 KB Output is correct
43 Correct 56 ms 888 KB Output is correct
44 Correct 53 ms 888 KB Output is correct
45 Correct 69 ms 868 KB Output is correct
46 Correct 72 ms 888 KB Output is correct
47 Correct 73 ms 760 KB Output is correct
48 Correct 73 ms 780 KB Output is correct
49 Correct 73 ms 824 KB Output is correct
50 Correct 68 ms 888 KB Output is correct
51 Correct 72 ms 888 KB Output is correct
52 Correct 66 ms 808 KB Output is correct
53 Correct 69 ms 880 KB Output is correct
54 Correct 68 ms 764 KB Output is correct
55 Correct 73 ms 928 KB Output is correct
56 Correct 67 ms 888 KB Output is correct
57 Correct 45 ms 916 KB Output is correct
58 Correct 69 ms 836 KB Output is correct
59 Correct 68 ms 888 KB Output is correct
60 Correct 74 ms 888 KB Output is correct