Skip to content

Instantly share code, notes, and snippets.

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> edge[2005];
int dfn[2005], low[2005];
int dfs_clock;
vector<int> Stack;
int scc_cnt;
#include <cstdio>
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> edge[105];
int dfs_clock, dfn[105], low[105];
int ans;
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
struct Point{
double x;
double y;
};
bool edge[105][105];
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> edge[105];
int llink[105], rlink[105];
bool used[105];
bool dfs(int now)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> edge[105];
int llink[105], rlink[105];
bool used[105];
bool dfs(int now)
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> toNxt[1000];
int llink[1000], rlink[1000];
bool used[1000];
int Bipartite(int n, int u, int v);
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> toNxt[1000];
int llink[1000], rlink[1000];
bool used[1000];
int Bipartite(int n, int u, int v);
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
int cap[500][500], flow[500][500];
int bottleneck[500], pre[500];
int main()
#include <cstdio>
#include <numeric>
#include <algorithm>
using namespace std;
bool dp[100005];
int num[100005];
int main()
{
#include <cstdio>
#include <algorithm>
using namespace std;
#define INF 999999999
int dp[10005];
int main()
{
int T, E, F;
int N, P[501], W[501];
scanf("%d", &T);