oj.uz

Submission #1094948

# Submission time Handle Problem Language Result Execution time Memory
1094948 2024-10-01T02:19:22 Z modwwe Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 1031 ms 332688 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 "test"
#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 = 1e17;
const int mod2 = 1e9 + 7;
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,k1,k2,s11;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int dp[5001][5001];
int dp2[5003];
int a[5001];
int b[5001];
vector<int> v[5001],v2;
unordered_set<int> s[5001];
void dfs(int x)
{

    s[x].insert(b[x]);
    s[x].insert(5000);
    for(auto f:v[x])
    {
        dfs(f);
        for(auto y:s[f])
            s[x].insert(y);
            s[f].clear();
    }
    for(auto j:s[x])
        dp[x][j]+=a[x];
    dp[x][b[x]]-=a[x];
    for(int j=1; j<=5000; j++)
    {
        if(s[x].find(j)==s[x].end())
            dp[x][j]=inf;
    }
    for(auto f:v[x])
    {
        dp2[5001]=inf;
        for(int j=5000; j>=1; j--)
        {
            dp2[j]=min(dp2[j+1],dp[f][j]);
            if(dp2[j]!=inf)
                   dp[x][j]+=dp2[j];
        }
    }
    if(x==1)
    {
        s4=inf;
        for(auto j:s[x])
            s4=min(s4,dp[1][j]);
    }
}
void phongbeo()
{
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>l>>b[i]>>a[i];
        if(i!=1) v[l].pb(i);
        v2.pb(b[i]);
    }
    sort(v2.begin(),v2.end());
    for(int i=1; i<=n; i++)
        b[i]=lower_bound(v2.begin(),v2.end(),b[i])-v2.begin()+1;
    dfs(1);
    cout<<s4;
}

Compilation message

worst_reporter2.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main()
      | ^~~~
worst_reporter2.cpp: In function 'void dfs(long long int)':
worst_reporter2.cpp:94:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   94 |         for(auto y:s[f])
      |         ^~~
worst_reporter2.cpp:96:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   96 |             s[f].clear();
      |             ^
worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:12:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:71:9: note: in expansion of macro 'fin'
   71 |         fin(task);
      |         ^~~
worst_reporter2.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 fou(x) freopen(x".out","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:72:9: note: in expansion of macro 'fou'
   72 |         fou(task);
      |         ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 864 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 165 ms 197972 KB Output is correct
6 Correct 160 ms 197504 KB Output is correct
7 Correct 161 ms 197456 KB Output is correct
8 Correct 173 ms 197744 KB Output is correct
9 Correct 160 ms 197460 KB Output is correct
10 Correct 163 ms 197356 KB Output is correct
11 Correct 151 ms 197464 KB Output is correct
12 Correct 1031 ms 332628 KB Output is correct
13 Correct 195 ms 198224 KB Output is correct
14 Correct 741 ms 267880 KB Output is correct
15 Correct 224 ms 202324 KB Output is correct
16 Correct 165 ms 197980 KB Output is correct
17 Correct 155 ms 197584 KB Output is correct
18 Correct 148 ms 197456 KB Output is correct
19 Correct 679 ms 265040 KB Output is correct
20 Correct 184 ms 200020 KB Output is correct
21 Correct 153 ms 197716 KB Output is correct
22 Correct 149 ms 197500 KB Output is correct
23 Correct 146 ms 197412 KB Output is correct
24 Correct 887 ms 297268 KB Output is correct
25 Correct 185 ms 199908 KB Output is correct
26 Correct 940 ms 332688 KB Output is correct
27 Correct 423 ms 238048 KB Output is correct
28 Correct 672 ms 274124 KB Output is correct
29 Correct 867 ms 306124 KB Output is correct
30 Correct 596 ms 267856 KB Output is correct
31 Correct 646 ms 267864 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 864 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 165 ms 197972 KB Output is correct
6 Correct 160 ms 197504 KB Output is correct
7 Correct 161 ms 197456 KB Output is correct
8 Correct 173 ms 197744 KB Output is correct
9 Correct 160 ms 197460 KB Output is correct
10 Correct 163 ms 197356 KB Output is correct
11 Correct 151 ms 197464 KB Output is correct
12 Correct 1031 ms 332628 KB Output is correct
13 Correct 195 ms 198224 KB Output is correct
14 Correct 741 ms 267880 KB Output is correct
15 Correct 224 ms 202324 KB Output is correct
16 Correct 165 ms 197980 KB Output is correct
17 Correct 155 ms 197584 KB Output is correct
18 Correct 148 ms 197456 KB Output is correct
19 Correct 679 ms 265040 KB Output is correct
20 Correct 184 ms 200020 KB Output is correct
21 Correct 153 ms 197716 KB Output is correct
22 Correct 149 ms 197500 KB Output is correct
23 Correct 146 ms 197412 KB Output is correct
24 Correct 887 ms 297268 KB Output is correct
25 Correct 185 ms 199908 KB Output is correct
26 Correct 940 ms 332688 KB Output is correct
27 Correct 423 ms 238048 KB Output is correct
28 Correct 672 ms 274124 KB Output is correct
29 Correct 867 ms 306124 KB Output is correct
30 Correct 596 ms 267856 KB Output is correct
31 Correct 646 ms 267864 KB Output is correct
32 Runtime error 231 ms 270932 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 864 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 0 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 165 ms 197972 KB Output is correct
6 Correct 160 ms 197504 KB Output is correct
7 Correct 161 ms 197456 KB Output is correct
8 Correct 173 ms 197744 KB Output is correct
9 Correct 160 ms 197460 KB Output is correct
10 Correct 163 ms 197356 KB Output is correct
11 Correct 151 ms 197464 KB Output is correct
12 Correct 1031 ms 332628 KB Output is correct
13 Correct 195 ms 198224 KB Output is correct
14 Correct 741 ms 267880 KB Output is correct
15 Correct 224 ms 202324 KB Output is correct
16 Correct 165 ms 197980 KB Output is correct
17 Correct 155 ms 197584 KB Output is correct
18 Correct 148 ms 197456 KB Output is correct
19 Correct 679 ms 265040 KB Output is correct
20 Correct 184 ms 200020 KB Output is correct
21 Correct 153 ms 197716 KB Output is correct
22 Correct 149 ms 197500 KB Output is correct
23 Correct 146 ms 197412 KB Output is correct
24 Correct 887 ms 297268 KB Output is correct
25 Correct 185 ms 199908 KB Output is correct
26 Correct 940 ms 332688 KB Output is correct
27 Correct 423 ms 238048 KB Output is correct
28 Correct 672 ms 274124 KB Output is correct
29 Correct 867 ms 306124 KB Output is correct
30 Correct 596 ms 267856 KB Output is correct
31 Correct 646 ms 267864 KB Output is correct
32 Runtime error 231 ms 270932 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -