# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1166479 | omar1312 | 은행 (IZhO14_bank) | C++20 | 1094 ms | 48084 KiB |
#pragma GCC optimize("O3,Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 200005;
#define int unsigned short
#define ll unsigned short
ll a[N+2], b[N+2], dp[N+2], f[N+2], nes[N+2];
vector<int> masks[N+2];
bool ok = 0;
int n, m;
void dfs(int mask, int idx){
if(idx == n){
ok = 1;
return;
}
if(ok)return;
for(auto &i : masks[a[idx]]){
if(!(mask & i)){
if(ok)return;
dfs(mask | i, idx + 1);
}
}
}
void solve(){
cin>>n>>m;
for(int i = 0; i < n; i++){
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |