oj.uz

Submission #943100

# Submission time Handle Problem Language Result Execution time Memory
943100 2024-03-11T08:14:57 Z yeediot Building 4 (JOI20_building4) C++14
100 / 100
 221 ms 68812 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=1e6+5;
pii dp[mxn][2];
int a[mxn];
int b[mxn];
void upd(pii &a,pii b,bool tf){
    a.F=min(a.F,tf+b.F);
    a.S=max(a.S,tf+b.S);
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=2*n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=2*n;i++){
        cin>>b[i];
    }
    for(int i=1;i<=2*n;i++){
        for(int j=0;j<2;j++){
            dp[i][j]={1e18,-1e18};
        }
    }
    for(int i=1;i<=2*n;i++){
        if(a[i-1]<=a[i])upd(dp[i][0],dp[i-1][0],1);
        if(a[i-1]<=b[i])upd(dp[i][1],dp[i-1][0],0);
        if(b[i-1]<=a[i])upd(dp[i][0],dp[i-1][1],1);
        if(b[i-1]<=b[i])upd(dp[i][1],dp[i-1][1],0);
    }
    if(dp[2*n][0].F<=n and n<=dp[2*n][0].S){
        vector<char>ans;
        ans.pb('A');
        int cur=n-1;
        int prev=a[2*n];
        for(int i=2*n;i>=2;i--){
            if(cur>0 and dp[i-1][0].F<=cur and dp[i-1][0].S>=cur and a[i-1]<=prev){
                ans.pb('A');
                cur--;
                prev=a[i-1];
            }
            else{
                ans.pb('B');
                prev=b[i-1];
            }
        }
        reverse(all(ans));
        for(auto i:ans){
            cout<<i;
        }
        cout<<'\n';
    }
    else if(dp[2*n][1].F<=n and n<=dp[2*n][1].S){
        vector<char>ans;
        ans.pb('B');
        int cur=n;
        int prev=b[2*n];
        for(int i=2*n;i>=2;i--){
            if(cur>0 and dp[i-1][0].F<=cur and dp[i-1][0].S>=cur and a[i-1]<=prev){
                ans.pb('A');
                cur--;
                prev=a[i-1];
            }
            else{
                ans.pb('B');
                prev=b[i-1];
            }
        }
        reverse(all(ans));
        for(auto i:ans){
            cout<<i;
        }
        cout<<'\n';
    }
    else{
        cout<<-1<<'\n';
    }
}
 /*
 input:
 
 */

Compilation message

building4.cpp: In function 'void setIO(std::string)':
building4.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
building4.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4604 KB Output is correct
15 Correct 2 ms 4696 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4440 KB Output is correct
19 Correct 2 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4500 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4604 KB Output is correct
15 Correct 2 ms 4696 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4440 KB Output is correct
19 Correct 2 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 2 ms 4500 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 167 ms 46864 KB Output is correct
35 Correct 178 ms 65452 KB Output is correct
36 Correct 172 ms 65128 KB Output is correct
37 Correct 175 ms 65648 KB Output is correct
38 Correct 164 ms 65488 KB Output is correct
39 Correct 181 ms 64944 KB Output is correct
40 Correct 189 ms 68300 KB Output is correct
41 Correct 166 ms 65384 KB Output is correct
42 Correct 194 ms 66668 KB Output is correct
43 Correct 197 ms 68716 KB Output is correct
44 Correct 221 ms 68404 KB Output is correct
45 Correct 189 ms 68776 KB Output is correct
46 Correct 187 ms 68812 KB Output is correct
47 Correct 180 ms 67792 KB Output is correct
48 Correct 187 ms 67628 KB Output is correct
49 Correct 192 ms 68556 KB Output is correct
50 Correct 190 ms 67788 KB Output is correct
51 Correct 198 ms 67804 KB Output is correct
52 Correct 134 ms 57040 KB Output is correct
53 Correct 131 ms 57032 KB Output is correct
54 Correct 130 ms 57016 KB Output is correct
55 Correct 128 ms 56684 KB Output is correct
56 Correct 179 ms 68672 KB Output is correct
57 Correct 165 ms 64360 KB Output is correct
58 Correct 156 ms 63952 KB Output is correct
59 Correct 161 ms 64216 KB Output is correct
60 Correct 149 ms 61628 KB Output is correct
61 Correct 161 ms 64460 KB Output is correct
62 Correct 157 ms 63696 KB Output is correct
63 Correct 181 ms 64356 KB Output is correct
64 Correct 169 ms 62760 KB Output is correct
65 Correct 194 ms 64464 KB Output is correct