oj.uz

Submission #933114

# Submission time Handle Problem Language Result Execution time Memory
933114 2024-02-25T06:15:42 Z yeediot Topical (NOI23_topical) C++14
100 / 100
 306 ms 86560 KB 
#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

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.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 188 ms 86560 KB Output is correct
5 Correct 197 ms 86520 KB Output is correct
6 Correct 183 ms 86308 KB Output is correct
7 Correct 151 ms 86312 KB Output is correct

Subtask #2
28.0 / 28.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 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 572 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 764 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 26 ms 8912 KB Output is correct
5 Correct 31 ms 9220 KB Output is correct
6 Correct 306 ms 80104 KB Output is correct
7 Correct 296 ms 80572 KB Output is correct
8 Correct 299 ms 81060 KB Output is correct
9 Correct 283 ms 79800 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 188 ms 86560 KB Output is correct
5 Correct 197 ms 86520 KB Output is correct
6 Correct 183 ms 86308 KB Output is correct
7 Correct 151 ms 86312 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 572 KB Output is correct
15 Correct 3 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 764 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 3 ms 1372 KB Output is correct
23 Correct 26 ms 8912 KB Output is correct
24 Correct 31 ms 9220 KB Output is correct
25 Correct 306 ms 80104 KB Output is correct
26 Correct 296 ms 80572 KB Output is correct
27 Correct 299 ms 81060 KB Output is correct
28 Correct 283 ms 79800 KB Output is correct
29 Correct 230 ms 29088 KB Output is correct
30 Correct 203 ms 24476 KB Output is correct
31 Correct 243 ms 28856 KB Output is correct
32 Correct 161 ms 28856 KB Output is correct
33 Correct 166 ms 24444 KB Output is correct
34 Correct 196 ms 27512 KB Output is correct
35 Correct 237 ms 29128 KB Output is correct
36 Correct 191 ms 27508 KB Output is correct
37 Correct 270 ms 27392 KB Output is correct
38 Correct 155 ms 29092 KB Output is correct