# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341188 | beksultan04 | Marriage questions (IZhO14_marriage) | C++14 | 1592 ms | 3436 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;
#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 1e5+12;
const ll INF=1e9+7;
vector <int> g[N],v;
int m,n,ans,l;
bool vis[N];
bool rec(int x,int l,int r){
if (x > m){
ret 1;
}
int i;
for (i=0;i<g[x].size();++i){
if (vis[g[x][i]] == 0 && l <= g[x][i] && g[x][i] <= r){
vis[g[x][i]]=1;
if (rec(x+1,l,r))ret 1;
vis[g[x][i]]=0;
}
}
ret 0;
}
main(){
int i,k,j,cnt=0;
scan3(n,m,k)
while (k-- ){
int x,y;
scan2(x,y)
g[y].pb(x);
}
int l=1,r=1;
while (r <= n){
memset(vis,0,sizeof(vis));
if (rec(1,l,r) == 0)r++;
else {
cnt += n-r+1;
l++;
}
}
cout <<cnt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |