oj.uz

답안 #1006649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1006649 2024-06-24T06:24:57 Z modwwe Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 68 ms 10444 KB 
//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#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;
void phongbeo();
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    int a,b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,c;
};
struct ie
{
    int a,b,c, d,e,f;

};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int  i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
      //  fin(task),fou(task);
#endif
NHP;
    /// cin>>s1;
    // modwwe
    phongbeo();
}
bool cmp(ib a,ib b)
{
    return a.a<b.a;
}
int dp1[200002];
int dp2[200002];
int ans[200002];
ib a[200002];
int b[200002];
void solve1()
{
    for(int i=1;i<n;i++)
        dp1[i]=max(a[i].a-b[i],dp1[i-1]);
}
void solve2()
 {
      for(int i=n;i>1;--i)
          dp2[i]=max(a[i].a-b[i-1],dp2[i+1]);
 }
void phongbeo()
{
      cin>>n;
      n++;
       for(int i=1;i<=n;i++)
cin>>a[i].a,a[i].b=i;
 for(int i=1;i<n;i++)
     cin>>b[i];
     sort(a+1,a+1+n,cmp);
     sort(b+1,b+n);
     solve1();
     solve2();
     for(int i=1;i<=n;i++)
        ans[a[i].b]=max(dp1[i-1],dp2[i+1]);
        for(int i=1;i<=n;i++)
            cout<<ans[i]<<" ";
 }

Compilation message

ho_t1.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main()
      | ^~~~
ho_t1.cpp: In function 'void phongbeo()':
ho_t1.cpp:81:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   81 |  for(int i=1;i<n;i++)
      |  ^~~
ho_t1.cpp:83:6: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   83 |      sort(a+1,a+1+n,cmp);
      |      ^~~~
ho_t1.cpp:87:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   87 |      for(int i=1;i<=n;i++)
      |      ^~~
ho_t1.cpp:89:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   89 |         for(int i=1;i<=n;i++)
      |         ^~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2512 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2504 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2512 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2504 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2648 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2512 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2504 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2648 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 61 ms 9588 KB Output is correct
34 Correct 62 ms 9584 KB Output is correct
35 Correct 62 ms 9672 KB Output is correct
36 Correct 66 ms 10072 KB Output is correct
37 Correct 64 ms 10444 KB Output is correct
38 Correct 62 ms 10096 KB Output is correct
39 Correct 59 ms 9296 KB Output is correct
40 Correct 62 ms 9324 KB Output is correct
41 Correct 60 ms 9300 KB Output is correct
42 Correct 60 ms 9248 KB Output is correct
43 Correct 62 ms 9132 KB Output is correct
44 Correct 68 ms 9040 KB Output is correct
45 Correct 59 ms 9040 KB Output is correct
46 Correct 59 ms 9032 KB Output is correct
47 Correct 46 ms 8784 KB Output is correct
48 Correct 51 ms 8784 KB Output is correct
49 Correct 61 ms 9532 KB Output is correct
50 Correct 59 ms 9400 KB Output is correct
51 Correct 66 ms 9552 KB Output is correct
52 Correct 62 ms 9484 KB Output is correct
53 Correct 60 ms 9552 KB Output is correct