oj.uz

Submission #124118

# Submission time Handle Problem Language Result Execution time Memory
124118 2019-07-02T14:30:21 Z HassenAissa Ice Hockey World Championship (CEOI15_bobek) C++14
30 / 100
 79 ms 396 KB 
#include <bits/stdc++.h>
#define int long long unsigned
using namespace std;

int32_t main()
{
    int n,m,d;
    scanf("%llu%llu",&n,&m);
    vector<int> tab;
    int pluss=0;
    int moins=0;
    for(int i=0; i<n; i++)
    {
        scanf("%llu",&d);
        if(d<=m)
            tab.push_back(d);
    }
    int res=0;

    for(int i=0; i<(1<<tab.size()); i++)
    {
        int total=0;
        int nomb=0;
        for(int j=0; j<=tab.size(); j++)
        {
            if((i&(1llu<<j))==0)
            {
                total+=tab[j];
            }
        }
        if(total<=m)
        {
            res++;
        }
    }
    printf("%llu\n",res);
    return 0;
}

Compilation message

bobek.cpp: In function 'int32_t main()':
bobek.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<(1<<tab.size()); i++)
                  ~^~~~~~~~~~~~~~~~
bobek.cpp:23:13: warning: unused variable 'nomb' [-Wunused-variable]
         int nomb=0;
             ^~~~
bobek.cpp:10:9: warning: unused variable 'pluss' [-Wunused-variable]
     int pluss=0;
         ^~~~~
bobek.cpp:11:9: warning: unused variable 'moins' [-Wunused-variable]
     int moins=0;
         ^~~~~
bobek.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%llu%llu",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~~~~
bobek.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%llu",&d);
         ~~~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Runtime error 2 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 392 KB Output is correct
2 Correct 6 ms 388 KB Output is correct
3 Correct 11 ms 396 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 6 ms 388 KB Output is correct
6 Correct 79 ms 392 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 252 KB Output is correct
2 Correct 20 ms 376 KB Output is correct
3 Correct 6 ms 380 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 78 ms 376 KB Output is correct
6 Correct 11 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -