oj.uz

답안 #1102327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102327 2024-10-18T02:32:25 Z modwwe Topical (NOI23_topical) C++17
100 / 100
 549 ms 160172 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#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 "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#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 + 7;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    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, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
vector<vector<int>> a;
vector<vector<int>>c;
vector<int> b;
struct cmp
{
    bool operator()(ib a,ib b)
    {
        return a.a>b.a;
    }
};
priority_queue<ib,vector<ib>,cmp>p[1000001];
void phongbeo()
{
    cin>>n>>m;
    a.resize(n+1,vector<int>(m+1));
    c.resize(n+1,vector<int>(m+1));
    b.resize(m+1);
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
            cin>>a[i][j];
        p[1].push({a[i][1],i});
    }
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin>>c[i][j];
    while(true)
    {
        bool de=0;
        for(int i=1; i<=m; i++)
        {
            while(!p[i].empty()&&p[i].top().a<=b[i])
            {
                ib x=p[i].top();
                if(i!=m)
                {
                    p[i+1].push({a[x.b][i+1],x.b});
                }
                else
                {
                    de=1;
                     s4++;
                    for(int j=1; j<=m; j++)
                        b[j]+=c[x.b][j];
                }
                p[i].pop();
            }
        }
        if(!de)
        {
            cout<<s4;
            exit(0);
        }
    }
}

Compilation message

Main.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:74:9: note: in expansion of macro 'fin'
   74 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fou'
   75 |         fou(task);
      |         ^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 31568 KB Output is correct
2 Correct 11 ms 31568 KB Output is correct
3 Correct 9 ms 32080 KB Output is correct
4 Correct 184 ms 102148 KB Output is correct
5 Correct 182 ms 102156 KB Output is correct
6 Correct 184 ms 102076 KB Output is correct
7 Correct 104 ms 70704 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 31568 KB Output is correct
2 Correct 10 ms 31568 KB Output is correct
3 Correct 8 ms 31568 KB Output is correct
4 Correct 9 ms 31600 KB Output is correct
5 Correct 8 ms 31568 KB Output is correct
6 Correct 8 ms 31592 KB Output is correct
7 Correct 10 ms 31992 KB Output is correct
8 Correct 10 ms 31920 KB Output is correct
9 Correct 9 ms 31824 KB Output is correct
10 Correct 9 ms 31824 KB Output is correct
11 Correct 12 ms 31824 KB Output is correct
12 Correct 10 ms 31824 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 31740 KB Output is correct
2 Correct 8 ms 31568 KB Output is correct
3 Correct 11 ms 33104 KB Output is correct
4 Correct 43 ms 45776 KB Output is correct
5 Correct 41 ms 45936 KB Output is correct
6 Correct 549 ms 159916 KB Output is correct
7 Correct 499 ms 159724 KB Output is correct
8 Correct 534 ms 160172 KB Output is correct
9 Correct 507 ms 159920 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 31568 KB Output is correct
2 Correct 11 ms 31568 KB Output is correct
3 Correct 9 ms 32080 KB Output is correct
4 Correct 184 ms 102148 KB Output is correct
5 Correct 182 ms 102156 KB Output is correct
6 Correct 184 ms 102076 KB Output is correct
7 Correct 104 ms 70704 KB Output is correct
8 Correct 9 ms 31568 KB Output is correct
9 Correct 10 ms 31568 KB Output is correct
10 Correct 8 ms 31568 KB Output is correct
11 Correct 9 ms 31600 KB Output is correct
12 Correct 8 ms 31568 KB Output is correct
13 Correct 8 ms 31592 KB Output is correct
14 Correct 10 ms 31992 KB Output is correct
15 Correct 10 ms 31920 KB Output is correct
16 Correct 9 ms 31824 KB Output is correct
17 Correct 9 ms 31824 KB Output is correct
18 Correct 12 ms 31824 KB Output is correct
19 Correct 10 ms 31824 KB Output is correct
20 Correct 9 ms 31740 KB Output is correct
21 Correct 8 ms 31568 KB Output is correct
22 Correct 11 ms 33104 KB Output is correct
23 Correct 43 ms 45776 KB Output is correct
24 Correct 41 ms 45936 KB Output is correct
25 Correct 549 ms 159916 KB Output is correct
26 Correct 499 ms 159724 KB Output is correct
27 Correct 534 ms 160172 KB Output is correct
28 Correct 507 ms 159920 KB Output is correct
29 Correct 150 ms 47920 KB Output is correct
30 Correct 156 ms 47608 KB Output is correct
31 Correct 190 ms 58216 KB Output is correct
32 Correct 121 ms 47924 KB Output is correct
33 Correct 113 ms 47440 KB Output is correct
34 Correct 124 ms 48460 KB Output is correct
35 Correct 158 ms 58312 KB Output is correct
36 Correct 184 ms 50348 KB Output is correct
37 Correct 161 ms 48456 KB Output is correct
38 Correct 183 ms 63676 KB Output is correct