Submission #686259

#	Time	Username	Problem	Language	Result	Execution time	Memory
686259		Alihan_8	Football (info1cup20_football)	C++17	0 / 100	414 ms	1048580 KiB

football

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int T; cin >> T;
    while ( T-- ){
        int n, k; cin >> n >> k;
        vector <int> p(n);
        for ( auto &i: p ) cin >> i;
        vector <int> dp(p.back()+1);
        for ( int i = 1; i <= p.back(); i++ ){
            for ( int j = 1; j <= k; j++ ){
                if ( i >= j and !dp[i-j] ){
                    dp[i] = true;
                    break;
                }
            }
        }
        cout << dp.back();
    }

    cout << '\n';
}

Compilation message (stderr)

football.cpp: In function 'void IO(std::string)':
football.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
football.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 26
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8