oj.uz

Submission #1086174

# Submission time Handle Problem Language Result Execution time Memory
1086174 2024-09-09T16:40:09 Z modwwe Ice Hockey World Championship (CEOI15_bobek) C++17
100 / 100
 275 ms 20948 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "numtable"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9')
    {
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9')
    {
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}

void phongbeo();
const int inf=1e9;
const int mod2=1e9+9;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid,l2,r2,center;
int  i,s10,s12;
int kk;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
///   fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
///modwwe
    phongbeo(),down
//checktime
}
int a[21];
int b[21];
void get(int n,int a[],vector<int>& v)
{
    for(int i=0; i<(1<<n); i++)
    {
        s2=0;
        for(int j=0; j<n; j++)
            if(bit(i,j))
                s2+=a[j+1];
        if(s2<=k)
            v.pb(s2);
    }
}
vector<int> v;
vector<int> v2;
void phongbeo()
{
    cin>>n>>k;

    for(int i=1; i<=n; i++)
        if(i<=n/2)
        {
            cin>>a[i];
        }
        else
        {
            cin>>b[i-n/2];
        }
    m=n-n/2;
    n=n/2;
    get(n,a,v);
    get(m,b,v2);
    sort(v.begin(),v.end());
    sort(v2.begin(),v2.end(),greater<int>());
    l=0;
    s4=0;
    for(int i=0; i<v.size(); i++)
    {
        while(l<v2.size()&&v2[l]+v[i]>k)
            l++;
        s4=s4+v2.size()-l;
    }
    cout<<s4;
}

Compilation message

bobek.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main()
      | ^~~~
bobek.cpp: In function 'void phongbeo()':
bobek.cpp:115:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for(int i=0; i<v.size(); i++)
      |                  ~^~~~~~~~~
bobek.cpp:117:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         while(l<v2.size()&&v2[l]+v[i]>k)
      |               ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2140 KB Output is correct
2 Correct 60 ms 5412 KB Output is correct
3 Correct 275 ms 20916 KB Output is correct
4 Correct 64 ms 5584 KB Output is correct
5 Correct 11 ms 1756 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 8 ms 348 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3032 KB Output is correct
2 Correct 21 ms 2144 KB Output is correct
3 Correct 102 ms 10512 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 992 KB Output is correct
6 Correct 18 ms 1756 KB Output is correct
7 Correct 6 ms 348 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 3676 KB Output is correct
2 Correct 89 ms 6736 KB Output is correct
3 Correct 90 ms 6644 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 64 ms 6740 KB Output is correct
6 Correct 226 ms 20948 KB Output is correct
7 Correct 33 ms 344 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 12844 KB Output is correct
2 Correct 20 ms 2144 KB Output is correct
3 Correct 7 ms 1064 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 1116 KB Output is correct
6 Correct 193 ms 12744 KB Output is correct
7 Correct 6 ms 348 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2144 KB Output is correct
2 Correct 59 ms 5584 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 7 ms 1084 KB Output is correct
5 Correct 64 ms 6872 KB Output is correct
6 Correct 21 ms 2144 KB Output is correct
7 Correct 92 ms 348 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 20916 KB Output is correct
2 Correct 22 ms 2144 KB Output is correct
3 Correct 7 ms 992 KB Output is correct
4 Correct 259 ms 20916 KB Output is correct
5 Correct 82 ms 10684 KB Output is correct
6 Correct 14 ms 1752 KB Output is correct
7 Correct 11 ms 348 KB Output is correct