oj.uz

Submission #1086707

# Submission time Handle Problem Language Result Execution time Memory
1086707 2024-09-11T09:43:04 Z modwwe September (APIO24_september) C++17
100 / 100
 150 ms 17100 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".ans","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=1e9;
const int mod2=1e9+9;
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;
int kk;
int el=29;
vector<ib> v2;
vector<int> v[100001];
ib a[100001];
void dfs()
{

     for(int x=n;x>=2;--x){
    ib xx= {inf,0};
    for(auto f:v[x])
    {
        if(a[f].b>=a[x].a)
        xx.a=min(xx.a,a[f].a),
        xx.b=max(xx.b,a[f].b);
    }
    if(x!=1)
        if(v[x].size()!=0&&xx.a!=inf)
        {
            if(xx.b>a[x].a)
            {
                xx.a=min(xx.a,a[x].a);
                xx.b=max(xx.b,a[x].b);
                a[x]=xx;
            }
        }
        }
}
bool cmp(ib a,ib b)
{
    if(a.a==b.a) return a.b>b.b;
    return a.a<b.a;
}
int solve(int N, int M, vector<int> F, vector<vector<int>> S)
{
 n=N;
  m=M;
    for(int i=1; i<=n; i++)
    {
        l=F[i-1];
        if(i!=1)
        {
            v[l+1].pb(i);
        }
        a[i]= {inf,0};
    }
    for(int i=1; i<=m; i++)
    {
        for(int j=1; j<=n-1; j++)
            l=S[i-1][j-1],l++,a[l].a=min(a[l].a,j),a[l].b=max(a[l].b,j);
    }
    dfs();
    for(int i=2; i<=n; i++)
    {
        v2.pb(a[i]);
    }
    sort(v2.begin(),v2.end(),cmp);
    s4=0;
    dem=0;


    for(auto x:v2)
    {
        if(x.a>s4)dem++;
        s4=max(s4,x.b);
    }
       for(int i=1;i<=n;i++)
        v[i].clear();
        v2.clear();
return dem;
}
/*
main()
{
     freopen("test.inp","r",stdin);
     freopen("test.ans","w",stdout);
     cin>>n>>m;
         vector<vector<int>> S;
S.resize(m,vector<int>(n));
      vector<int> F;
      for(int i=1;i<=n;i++)
      {
          cin>>l;
           F.pb(l);
      }
       for(int i=0;i<m;i++)
       {
           for(int j=0;j<n;j++ )
            cin>>S[i][j];
       }
       cout<<solve(n,m,F,S);
}
*/

Compilation message

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:131:8: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  131 |        for(int i=1;i<=n;i++)
      |        ^~~
september.cpp:133:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  133 |         v2.clear();
      |         ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2808 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2808 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2808 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2912 KB Output is correct
14 Correct 2 ms 2828 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2964 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2808 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2904 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2912 KB Output is correct
21 Correct 2 ms 2828 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Correct 2 ms 2964 KB Output is correct
28 Correct 3 ms 2904 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 3 ms 2908 KB Output is correct
31 Correct 3 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2904 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 97 ms 17080 KB Output is correct
5 Correct 106 ms 16884 KB Output is correct
6 Correct 101 ms 17076 KB Output is correct

Subtask #8
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2808 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2648 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2912 KB Output is correct
14 Correct 2 ms 2828 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 97 ms 17080 KB Output is correct
19 Correct 106 ms 16884 KB Output is correct
20 Correct 101 ms 17076 KB Output is correct
21 Correct 147 ms 16304 KB Output is correct
22 Correct 146 ms 16312 KB Output is correct
23 Correct 143 ms 16880 KB Output is correct
24 Correct 143 ms 16924 KB Output is correct
25 Correct 150 ms 16316 KB Output is correct
26 Correct 147 ms 16384 KB Output is correct
27 Correct 146 ms 16880 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 2964 KB Output is correct
7 Correct 97 ms 17080 KB Output is correct
8 Correct 106 ms 16884 KB Output is correct
9 Correct 101 ms 17076 KB Output is correct
10 Correct 61 ms 17096 KB Output is correct
11 Correct 58 ms 17096 KB Output is correct
12 Correct 66 ms 17100 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2808 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2904 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2912 KB Output is correct
21 Correct 2 ms 2828 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Correct 2 ms 2964 KB Output is correct
28 Correct 3 ms 2904 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 3 ms 2908 KB Output is correct
31 Correct 3 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2904 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 97 ms 17080 KB Output is correct
36 Correct 106 ms 16884 KB Output is correct
37 Correct 101 ms 17076 KB Output is correct
38 Correct 147 ms 16304 KB Output is correct
39 Correct 146 ms 16312 KB Output is correct
40 Correct 143 ms 16880 KB Output is correct
41 Correct 143 ms 16924 KB Output is correct
42 Correct 150 ms 16316 KB Output is correct
43 Correct 147 ms 16384 KB Output is correct
44 Correct 146 ms 16880 KB Output is correct
45 Correct 61 ms 17096 KB Output is correct
46 Correct 58 ms 17096 KB Output is correct
47 Correct 66 ms 17100 KB Output is correct
48 Correct 68 ms 15560 KB Output is correct
49 Correct 70 ms 15476 KB Output is correct
50 Correct 66 ms 16008 KB Output is correct
51 Correct 66 ms 16012 KB Output is correct
52 Correct 66 ms 15564 KB Output is correct
53 Correct 65 ms 15560 KB Output is correct
54 Correct 65 ms 16072 KB Output is correct