oj.uz

답안 #880737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880737 2023-11-30T00:46:10 Z cpptowin Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 88 ms 34896 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n;
int max1[maxn],max2[maxn],nxt[maxn],val[maxn];
int a[maxn],b[maxn];
pii arr[maxn];
int pos[maxn];
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n;
    fo(i,1,n + 1) cin >> a[i],arr[i] = {a[i],i};
    fo(i,1,n) cin >> b[i];
    sort(a + 1,a + n + 2);
    sort(arr + 1,arr + n + 2);
    fo(i,1,n + 1) pos[arr[i].se] = i;
    sort(b + 1,b + n + 1);
    // fo(i,1,n + 1) cout << a[i] << "\n";
    // cout << "xxxxxxxxxxxxxxx";en;
    // fo(i,1,n) cout << b[i] << "\n";
    fo(i,1,n)
    {
        nxt[i] = max(a[i + 1] - b[i],0LL);
        val[i] = max(a[i] - b[i],0LL);
    }
    fo(i,1,n)
    {
        max1[i] = max(max1[i - 1],val[i]);
    }
    fod(i,n,1)
    {
        max2[i] = max(max2[i + 1],nxt[i]);
    }
    fo(i,1,n + 1)
    {
        int id = pos[i];
        cout << max(max1[id - 1],max2[id]) << ' ';
    }
}

Compilation message

ho_t1.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main()
      | ^~~~
ho_t1.cpp: In function 'int main()':
ho_t1.cpp:32:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
ho_t1.cpp:33:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 1 ms 10708 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 1 ms 10708 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 2 ms 10588 KB Output is correct
13 Correct 1 ms 10584 KB Output is correct
14 Correct 2 ms 10584 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 2 ms 10840 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10588 KB Output is correct
20 Correct 2 ms 10720 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 2 ms 10724 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 3 ms 10840 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10588 KB Output is correct
29 Correct 2 ms 10588 KB Output is correct
30 Correct 2 ms 10588 KB Output is correct
31 Correct 3 ms 10588 KB Output is correct
32 Correct 2 ms 10588 KB Output is correct
33 Correct 82 ms 34244 KB Output is correct
34 Correct 85 ms 34644 KB Output is correct
35 Correct 83 ms 34388 KB Output is correct
36 Correct 83 ms 34848 KB Output is correct
37 Correct 87 ms 34896 KB Output is correct
38 Correct 85 ms 34764 KB Output is correct
39 Correct 82 ms 33876 KB Output is correct
40 Correct 85 ms 34052 KB Output is correct
41 Correct 84 ms 34132 KB Output is correct
42 Correct 84 ms 33932 KB Output is correct
43 Correct 86 ms 34132 KB Output is correct
44 Correct 81 ms 33608 KB Output is correct
45 Correct 81 ms 33868 KB Output is correct
46 Correct 81 ms 33584 KB Output is correct
47 Correct 72 ms 33616 KB Output is correct
48 Correct 72 ms 33596 KB Output is correct
49 Correct 85 ms 34132 KB Output is correct
50 Correct 86 ms 34244 KB Output is correct
51 Correct 85 ms 34100 KB Output is correct
52 Correct 85 ms 34132 KB Output is correct
53 Correct 88 ms 34140 KB Output is correct