# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532855 | 79brue | Newspapers (CEOI21_newspapers) | C++14 | 98 ms | 508 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace Naive{
int n, m;
int dissappear[25];
vector<int> link[25];
int movemove(int source){
int rv = 0;
for(int i=0; i<n; i++){
if(source & (1<<i)){
for(int j=0; j<(int)link[i].size(); j++){
rv |= (1<<link[i][j]);
}
}
}
// printf("movemove %d is %d\n", source, rv);
return rv;
}
void bfs(){
int temp;
map<int, bool> visited;
map<int, pair<int, int> > parent;
queue<int> que;
stack<int> ans;
Compilation message (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... |