1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T448,#include using namespace std; #define int long long const int MX = 1e5+2; int lst[MX], init[MX], cur[MX]; // ADGHJ // CIEEEFFICFIEECEFFB int32_t main() { ios::sync_with_stdio(0);cin.tie(0); int n, m; cin >> n >> m; vector> v(m); for(int i=0; i> t; v[i].resize(t); for(int j=0; j> v[i][j]; } for(int i=1; i<=n; i++) { cin >> lst[i]; init[i] = lst[i]; } for(int i=m-1; i>=0; i--) { int all = 1; for(int t: v[i]) { if(!init[t]) { all = 0; break; } } if(!all) { for(int t: v[i]) { init[t] = 0; } } } //printf("init:\n"); // for(int i=1; i<=n; i++) { // printf("%d ", cur[i]); // } // printf("\n"); memcpy(cur, init, sizeof cur); for(int i=0; i

코드 #5965