Submission #1162693

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162693		yeediot	Card Collection (JOI24_collection)	C++20	11 / 100	4094 ms	20300 KiB

Main

#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 CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
void solve(){
    int n, m;
    cin >> n >> m;
    vector<int>s(n + 1), v(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> s[i] >> v[i];
    }
    auto conv = [&](int ns, int nv, int cs, int cv){
        int r1 = (cs > ns ? 2 : cs == ns ? 1 : 0);
        int r2 = (cv > nv ? 2 : cv == nv ? 1 : 0);
        return make_pair(r1, r2);
    };
    auto op = [&](pii a, pii b, bool flg){
        return make_pair((flg ? min(a.F, b.F) : max(a.F, b.F)), (flg ? min(a.S, b.S) : max(a.S, b.S)));
    };
    for(int _ = 1; _ <= m; _++){
        int ns, nv;
        cin >> ns >> nv;
        bool dp[n + 2][n + 2][3][3];
        for(int i = 1; i <= n; i++){
            for(int j = i; j <= n; j++){
                for(int k = 0; k < 3; k++){
                    for(int l = 0; l < 3; l++){
                        dp[i][j][k][l] = 0;
                    }
                }
            }
            auto p = conv(ns, nv, s[i], v[i]);
            dp[i][i][p.F][p.S] = 1;
        }
        for(int i = n; i >= 1; i--){
            for(int j = i + 1; j <= n; j++){
                for(int k = 0; k < 3; k++){
                    for(int l = 0; l < 3; l++){
                        if(dp[i + 1][j][k][l] == 0) continue;
                        auto p = conv(ns, nv, s[i], v[i]);
                        for(int r = 0; r < 2; r++){
                            auto pp = op(p, {k, l}, r);
                            dp[i][j][pp.F][pp.S] = 1; 
                        }
                    }
                }
                for(int k = 0; k < 3; k++){
                    for(int l = 0; l < 3; l++){
                        if(dp[i][j - 1][k][l] == 0) continue;
                        auto p = conv(ns, nv, s[j], v[j]);
                        for(int r = 0; r < 2; r++){
                            auto pp = op(p, {k, l}, r);
                            dp[i][j][pp.F][pp.S] = 1; 
                        }
                    }
                }
                for(int d = i + 1; d <= j - 1; d++){
                    auto p = conv(ns, nv, s[d], v[d]);
                    //debug(i, p, ns, nv, s[d], v[d]);
                    for(int k = 0; k < 3; k++){
                        for(int l = 0; l < 3; l++){
                            if(d - 1 >= i and !dp[i][d - 1][k][l]) continue;
                            for(int g = 0; g < 3; g++){
                                for(int h = 0; h < 3; h++){
                                    if(d + 1 <= j and !dp[d + 1][j][g][h]) continue;
                                    for(int r = 0; r < 2; r++){
                                        for(int w = 0; w < 2; w++){
                                            auto pp = op(op({k, l}, p, r), {g, h}, w);
                                            dp[i][j][pp.F][pp.S] = 1;
                                            pp = op(op({g, h}, p, r), {k, l}, w);
                                            dp[i][j][pp.F][pp.S] = 1;
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
                for(int k = 0; k < 3; k++){
                    for(int l = 0; l < 3; l++){
                        debug(ns, nv, i, j, dp[i][j][k][l], k, l);
                    }
                }
            }
        }
        if(dp[1][n][1][1]) cout << _ << ' ';
    }
    cout << '\n';
}
signed main(){
    TOI_is_so_de;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
        std::ifstream file1(p1);
        std::ifstream file2(p2);
        if(!file1.is_open() || !file2.is_open()) return false;
        std::string line1, line2;
        while (getline(file1, line1) && getline(file2, line2)) {
            if (line1 != line2)return false;
        }
        int cnta = 0, cntb = 0;
        while(getline(file1,line1))cnta++;
        while(getline(file2,line2))cntb++;
        return cntb - cnta <= 1;
    };
    bool check = compareFiles("output.txt","expected.txt");
    if(check) cerr<<"ACCEPTED\n";
    else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

• Subtask 1: 11 / 11
• Subtask 2: 0 / 38
• Subtask 3: 0 / 22
• Subtask 4: 0 / 29