# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
133396 | tlwpdus | Friends (BOI17_friends) | C++11 | 3 ms | 1244 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 pair<int,int> pii;
int n, p, q;
vector<int> lis[3000];
int mat[3000][3000];
void pung() {
puts("detention");
exit(0);
}
int gn;
vector<int> grp[3000];
int chk[3000], inc[3000];
vector<int> sel, cand;
void print() {
printf("sel : ");
for (int &v : sel) printf("%d ",v); printf("\n");
printf("cand : ");
for (int &v : cand) printf("%d ",v); printf("\n\n");
}
bool bt(int nq, int dep) {
//printf("%d, %d\n",sel.size(),nq);
//print();
if (sel.size()<=p&&nq<=q) return true;
if (dep>=p+q||cand.empty()) return false;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |