oj.uz

Submission #982101

# Submission time Handle Problem Language Result Execution time Memory
982101 2024-05-13T20:29:21 Z shadow_sami Building 4 (JOI20_building4) C++17
11 / 100
 171 ms 67068 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll dp[2][mx][2];
ll a[mx][2];

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n;
        fip(0,2*n)
        	cin>>a[i][0];
        fip(0,2*n)
        	cin>>a[i][1];
        dp[0][0][0] = 1;
        dp[0][0][1] = 0;
        dp[1][0][0] = 1;
        dp[1][0][1] = 0;
        fip(1,2*n+1)
        	fp(k,0,2)
        		fp(l,0,2)dp[k][i][l] = (k?-1e18:1e18);
        fip(1,2*n)
        	fp(k,0,2){
        		fp(l,0,2){
        			if(a[i-1][k]<=a[i][l]){
        				dp[0][i][l] = min(dp[0][i][l],dp[0][i-1][k]+(l==0));
        				dp[1][i][l] = max(dp[1][i][l],dp[1][i-1][k]+(l==0));
        			}
        		}        			
        	}
        string na;
        f = 0;
        tp = 0;
        tptp = 1e18;
        fin(2*n-1,0){
        	tp2 = n - tp;
        	if(tptp >= a[i][0] && dp[0][i][0] <= tp2 && tp2 <= dp[1][i][0]){
        		na.push_back('A');
        		tp++;
        		tptp = a[i][0];
        	}else if(tptp >= a[i][1] && dp[0][i][1] <= tp2 && tp2 <= dp[1][i][1]){
        		na.push_back('B');        		
        		tptp = a[i][1];
        	}else{
        		na = "1-";
        		break;
        	}
        }
        reverse(na.begin(),na.end());
        cout<<na<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4564 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4576 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4520 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4680 KB Output is correct
11 Correct 2 ms 4704 KB Output is correct
12 Correct 2 ms 4704 KB Output is correct
13 Correct 2 ms 4704 KB Output is correct
14 Correct 1 ms 4704 KB Output is correct
15 Correct 1 ms 4704 KB Output is correct
16 Correct 2 ms 4704 KB Output is correct
17 Correct 2 ms 4708 KB Output is correct
18 Correct 2 ms 4708 KB Output is correct
19 Correct 1 ms 4704 KB Output is correct
20 Correct 2 ms 4704 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4456 KB Output is correct
24 Correct 1 ms 4576 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4448 KB Output is correct
27 Correct 1 ms 4448 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4700 KB Output is correct
30 Correct 1 ms 4448 KB Output is correct
31 Correct 1 ms 4664 KB Output is correct
32 Correct 2 ms 4448 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4564 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4576 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4520 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4680 KB Output is correct
11 Correct 2 ms 4704 KB Output is correct
12 Correct 2 ms 4704 KB Output is correct
13 Correct 2 ms 4704 KB Output is correct
14 Correct 1 ms 4704 KB Output is correct
15 Correct 1 ms 4704 KB Output is correct
16 Correct 2 ms 4704 KB Output is correct
17 Correct 2 ms 4708 KB Output is correct
18 Correct 2 ms 4708 KB Output is correct
19 Correct 1 ms 4704 KB Output is correct
20 Correct 2 ms 4704 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4456 KB Output is correct
24 Correct 1 ms 4576 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4448 KB Output is correct
27 Correct 1 ms 4448 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4700 KB Output is correct
30 Correct 1 ms 4448 KB Output is correct
31 Correct 1 ms 4664 KB Output is correct
32 Correct 2 ms 4448 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Runtime error 171 ms 67068 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -