Submission #933114

#	Time	Username	Problem	Language	Result	Execution time	Memory
933114		yeediot	Topical (NOI23_topical)	C++14	100 / 100	306 ms	86560 KiB

Main

#include<bits/stdc++.h>
 using namespace std;
 #define int long long
 #define F first
 #define S second
 #define all(x) x.begin(),x.end()
 #define pii pair<int,int>
 #define pb push_back
 #define sz(x) (int)(x.size())
 #define chmin(x,y) x=min(x,y)
 #define chmax(x,y) x=max(x,y)
 #define vi vector<int>
 #define vp vector<pii>
 #define vvi vector<vi>
 #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
 #define __lg(x) 63-__builtin_clzll(x)
 #define pow2(x) (1LL<<x)
 void __print(int x) {cerr << x;}
 void __print(float x) {cerr << x;}
 void __print(double x) {cerr << x;}
 void __print(long double x) {cerr << x;}
 void __print(char x) {cerr << '\'' << x << '\'';}
 void __print(const char *x) {cerr << '\"' << x << '\"';}
 void __print(const string &x) {cerr << '\"' << x << '\"';}
 void __print(bool x) {cerr << (x ? "true" : "false");}
 
 template<typename T, typename V>
 void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
 template<typename T>
 void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
 void _print() {cerr << "]\n";}
 template <typename T, typename... V>
 void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
 #ifdef local
 void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
 #define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
 #else
 void setio(){}
 #define debug(x...)
 #endif
 void setIO(string s) {
     freopen((s + ".in").c_str(), "r", stdin);
     freopen((s + ".out").c_str(), "w", stdout);
 }
 struct line{
     int a,b;
     int operator()(const int x)const{
         return a*x+b;
     }
 };
 bool check(line l1,line l2,line l3){
     return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
 }

signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,k;
    cin>>n>>k;
    vector<pii>v[k+1];
    vector<vector<int>>u(n+1,vector<int>(k+1));
    vector<int>left(n+1,k);
    vi temp;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            int x;
            cin>>x;
            v[j].pb({x,i});
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            cin>>u[i][j];
        }
    }
    for(int j=1;j<=k;j++)sort(all(v[j]));
    vector<int>idx(k+1,0),cur(k+1);
    int ans=0;
    while(1){
        bool flag=0;
        for(int i=1;i<=k;i++){
            while(idx[i]<sz(v[i]) and v[i][idx[i]].F<=cur[i]){
                auto [need,id]=v[i][idx[i]];
                left[id]--;
                if(left[id]==0){
                    ans++;
                    for(int j=1;j<=k;j++){
                        cur[j]+=u[id][j];
                    }
                    debug(id,cur);
                    flag=1;
                }
                idx[i]++;
            }
        }
        if(!flag){
            break;
        }
    }
    cout<<ans<<'\n';
 }
  /*
  input:
  
  */
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
   

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:84:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |                 auto [need,id]=v[i][idx[i]];
      |                      ^
Main.cpp: In function 'void setIO(std::string)':
Main.cpp:42:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |      freopen((s + ".in").c_str(), "r", stdin);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:43:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |      freopen((s + ".out").c_str(), "w", stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 12 / 12
• Subtask 2: 28 / 28
• Subtask 3: 21 / 21
• Subtask 4: 39 / 39