oj.uz

답안 #341188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341188 2020-12-29T05:28:47 Z beksultan04 결혼 문제 (IZhO14_marriage) C++14
44 / 100
 1500 ms 3436 KB 
#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

marriage.cpp: In function 'bool rec(int, int, int)':
marriage.cpp:34:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (i=0;i<g[x].size();++i){
      |              ~^~~~~~~~~~~~
marriage.cpp: At global scope:
marriage.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main(){
      |      ^
marriage.cpp: In function 'int main()':
marriage.cpp:45:9: warning: unused variable 'i' [-Wunused-variable]
   45 |     int i,k,j,cnt=0;
      |         ^
marriage.cpp:45:13: warning: unused variable 'j' [-Wunused-variable]
   45 |     int i,k,j,cnt=0;
      |             ^
marriage.cpp:16:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 | #define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~
marriage.cpp:46:5: note: in expansion of macro 'scan3'
   46 |     scan3(n,m,k)
      |     ^~~~~
marriage.cpp:15:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 | #define scan2(a,b) scanf("%d %d",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~
marriage.cpp:49:9: note: in expansion of macro 'scan2'
   49 |         scan2(x,y)
      |         ^~~~~

Subtask #1
44.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2940 KB Output is correct
2 Correct 2 ms 2796 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 2 ms 2924 KB Output is correct
5 Correct 2 ms 2796 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 4 ms 2796 KB Output is correct
8 Correct 2 ms 2796 KB Output is correct
9 Correct 2 ms 2796 KB Output is correct
10 Correct 2 ms 2796 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 2 ms 2796 KB Output is correct
16 Correct 2 ms 2796 KB Output is correct
17 Correct 2 ms 2796 KB Output is correct
18 Correct 2 ms 2796 KB Output is correct
19 Execution timed out 1591 ms 2796 KB Time limit exceeded
20 Execution timed out 1583 ms 2796 KB Time limit exceeded
21 Execution timed out 1541 ms 2796 KB Time limit exceeded
22 Correct 3 ms 2796 KB Output is correct
23 Execution timed out 1589 ms 2796 KB Time limit exceeded
24 Execution timed out 1579 ms 2796 KB Time limit exceeded
25 Execution timed out 1552 ms 2796 KB Time limit exceeded
26 Execution timed out 1585 ms 2796 KB Time limit exceeded
27 Execution timed out 1576 ms 2796 KB Time limit exceeded
28 Correct 15 ms 2796 KB Output is correct
29 Execution timed out 1573 ms 2944 KB Time limit exceeded
30 Execution timed out 1584 ms 2796 KB Time limit exceeded
31 Execution timed out 1586 ms 3052 KB Time limit exceeded
32 Execution timed out 1579 ms 2796 KB Time limit exceeded
33 Correct 7 ms 2796 KB Output is correct
34 Correct 567 ms 2924 KB Output is correct
35 Execution timed out 1544 ms 3308 KB Time limit exceeded
36 Execution timed out 1558 ms 3436 KB Time limit exceeded
37 Execution timed out 1583 ms 3052 KB Time limit exceeded
38 Execution timed out 1549 ms 3308 KB Time limit exceeded
39 Execution timed out 1577 ms 3180 KB Time limit exceeded
40 Execution timed out 1591 ms 2924 KB Time limit exceeded
41 Execution timed out 1588 ms 2924 KB Time limit exceeded
42 Execution timed out 1581 ms 2944 KB Time limit exceeded
43 Execution timed out 1580 ms 3052 KB Time limit exceeded
44 Execution timed out 1588 ms 3308 KB Time limit exceeded
45 Execution timed out 1589 ms 3052 KB Time limit exceeded
46 Execution timed out 1570 ms 3308 KB Time limit exceeded
47 Execution timed out 1592 ms 3308 KB Time limit exceeded
48 Execution timed out 1579 ms 3308 KB Time limit exceeded
49 Execution timed out 1553 ms 3308 KB Time limit exceeded
50 Execution timed out 1591 ms 3308 KB Time limit exceeded