oj.uz

답안 #720364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720364 2023-04-08T05:12:05 Z Huseyn123 디지털 회로 (IOI22_circuit) C++17
2 / 100
 44 ms 26336 KB 
#include "circuit.h"
#include <bits/stdc++.h>
#define MAX 300001
#define INF LLONG_MAX
#define MOD 1000002022
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define gett(x,m) get<m>(x)
#define all(a) a.begin(),a.end()
#define lb(a,b) lower_bound(all(a),b)
#define ub(a,b) upper_bound(all(a),b)
#define sortv(a) sort(all(a))
#define sorta(a,sz) sort(a,a+sz)
#define inputar(a,b){\
    for(int i=0;i<b;i++){\
        cin >> a[i];\
    }\
}
#define inputvec(a,b){\
    for(int i=0;i<b;i++){\
        ll num;\
        cin >> num;\
        a.pb(num);\
    }\
}
#define outputar(a,b){\
    for(int i=0;i<b;i++){\
        cout << a[i] << " ";\
    }\
    cout << "\n";\
}
#define outputvec(a){\
    for(auto x:a){\
        cout << x << " ";\
    }\
    cout << "\n";\
}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll,ll> tll;
typedef pair<ll,ll> pll;
typedef double db;
typedef long double ldb;
inline void USACO(string filename){
  freopen((filename+".in").c_str(),"r",stdin);
  freopen((filename+".out").c_str(),"w",stdout);
}
ll n,q,t=1,m,n2,m2,k,cnt=0,x,y,z,x2,y2,z2,res1=0,cnt1,cnt2,cnt3;
ll c[501][501];
ll fact[MAX];
ll inv_fact[MAX];
//char c;
string str[MAX];
string s1,s2;
vector<tuple<ll,ll,ll>> v;
vector<pll> v1,v2,v3,v4;
const int mod = 998244353;
vector<int> a,b;
vector<vector<ll>> g;
ll dp[1001][1001];
ll dp3[1001][2];
void dfs(ll v){
    if(v>=n){
        if(b[v-n]==0){
            dp3[v][0]=1;
            dp3[v][1]=0;
        }
        else{
            dp3[v][0]=0;
            dp3[v][1]=1;
        }
        return;
    }
    ll sz=g[v].size();
    for(int i=0;i<=sz;i++){
        dp[v][i]=0;
    }
    dp3[v][0]=0;
    dp3[v][1]=0;
    dp[v][0]=1;
    if(sz>0){
        vector<ll> arr(sz+1,0);
        for(auto x:g[v]){
            dfs(x);
            for(int i=0;i<=sz;i++){
                arr[i]+=(dp[v][i]*dp3[x][0])%MOD;
                arr[i]%=MOD;
            }
            for(int i=1;i<=sz;i++){
                arr[i]+=(dp[v][i-1]*dp3[x][1])%MOD;
                arr[i]%=MOD;
            }
            for(int i=0;i<=sz;i++){
                dp[v][i]=arr[i];
                arr[i]=0;
            }
        }
    }
    for(ll i=0;i<=sz;i++){
        dp3[v][1]+=(i*dp[v][i])%MOD;
        dp3[v][0]+=((sz-i)*dp[v][i])%MOD;
        dp3[v][1]%=MOD;
        dp3[v][0]%=MOD;
    }
}
void init(int N, int M, std::vector<int> P, std::vector<int> A) {
    n=N;
    m=M;
    a=P;
    b=A;
    g.resize(N+M);
    for(int i=1;i<N+M;i++){
        g[P[i]].pb(i);
    }
}
int count_ways(int L, int R) {
  for(int i=L-n;i<=R-n;i++){
      b[i]=(1-b[i]);
  }
  dfs(0);
  return dp3[0][1];
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 44 ms 9780 KB Output is correct
4 Correct 33 ms 9680 KB Output is correct
5 Correct 35 ms 9792 KB Output is correct
6 Correct 35 ms 9772 KB Output is correct
7 Correct 34 ms 9680 KB Output is correct
8 Correct 36 ms 9784 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9680 KB Output is correct
2 Correct 7 ms 10704 KB Output is correct
3 Incorrect 8 ms 11728 KB 1st lines differ - on the 1st token, expected: '655368480', found: '112368636'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 44 ms 9780 KB Output is correct
4 Correct 33 ms 9680 KB Output is correct
5 Correct 35 ms 9792 KB Output is correct
6 Correct 35 ms 9772 KB Output is correct
7 Correct 34 ms 9680 KB Output is correct
8 Correct 36 ms 9784 KB Output is correct
9 Correct 6 ms 9680 KB Output is correct
10 Correct 7 ms 10704 KB Output is correct
11 Incorrect 8 ms 11728 KB 1st lines differ - on the 1st token, expected: '655368480', found: '112368636'
12 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 26 ms 26336 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 26 ms 26336 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9680 KB Output is correct
2 Correct 7 ms 10704 KB Output is correct
3 Incorrect 8 ms 11728 KB 1st lines differ - on the 1st token, expected: '655368480', found: '112368636'
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 44 ms 9780 KB Output is correct
4 Correct 33 ms 9680 KB Output is correct
5 Correct 35 ms 9792 KB Output is correct
6 Correct 35 ms 9772 KB Output is correct
7 Correct 34 ms 9680 KB Output is correct
8 Correct 36 ms 9784 KB Output is correct
9 Correct 6 ms 9680 KB Output is correct
10 Correct 7 ms 10704 KB Output is correct
11 Incorrect 8 ms 11728 KB 1st lines differ - on the 1st token, expected: '655368480', found: '112368636'
12 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9680 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 44 ms 9780 KB Output is correct
4 Correct 33 ms 9680 KB Output is correct
5 Correct 35 ms 9792 KB Output is correct
6 Correct 35 ms 9772 KB Output is correct
7 Correct 34 ms 9680 KB Output is correct
8 Correct 36 ms 9784 KB Output is correct
9 Correct 6 ms 9680 KB Output is correct
10 Correct 7 ms 10704 KB Output is correct
11 Incorrect 8 ms 11728 KB 1st lines differ - on the 1st token, expected: '655368480', found: '112368636'
12 Halted 0 ms 0 KB -