“蔚来杯“2022牛客暑期多校训练营4 DHKLN

D.Jobs (Easy Version) 题目大意

三维偏序问题，队友写了个假做法过了。

待补

Code

#include 
#pragma gcc optimize("O2")
#pragma g++ optimize("O2")
//#define int long long
#define endl '\n'
using namespace std;


const int N = 2e5 + 10, MOD = 998244353;
int n, q, x, y, z;
int k1,k2,k3,k4;
bitsetfk[11][401][401];
inline int getid(int x,int y,int z){
    return 160801*(x)+(y)*(401)+z;
}
int getans(int iq, int eq, int aq){
    int ans=0;
    for(int i=1;i>= 1, (x *= x) %= mod) if (y & 1) (res *= x) %= mod;
    return res;
}

int powq[2000010];

inline void solve(){
    cin >> n >> q;
    for(int i = 1; i > k1;
        for(int j = 1; j >x>>y>>z;
            fk[i][x][y][z]=1;
        }
    } 
    
    for(short i=1;i