oj.uz

답안 #677457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677457 2023-01-03T11:47:23 Z DwightKSchrute Team Contest (JOI22_team) C++17
26 / 100
 2000 ms 28584 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
map<int,int>val;
void compress(vvi& a){
    vi s;
    for(vi v:a)
        for(int x:v)
            s.pb(x);
    sort(all(s));
    s=UNQ(s);

    for(vi& v:a)
        for(int& x:v){
            int to = lower_bound(all(s),x)-s.begin();
            val[to] = x;
            x = to;
        }
}

const int MAXN = 8000;
int t[MAXN];

void upd(int i,int v){
    i+=MAXN/2;
    t[i]=max(t[i],v);
    while(i>1){
        t[i/2] = max(t[i],t[i^1]);
        i/=2;
    }
}
int qur(int l,int r){
    int ans=-1e9;
    for(l+=MAXN/2,r+=MAXN/2 +1; l<r; l/=2,r/=2){
        if(l&1)ans=max(ans,t[l++]);
        if(r&1)ans=max(ans,t[--r]);
    }
    return ans;
}

void solve() {
    int n;
    cin >> n;
    vvi a(n,vi(3));
    for(int i=0; i<n; i++){
        read(a[i]);
    }
    sort(all(a));
    a=UNQ(a);
    n=a.size();
    compress(a);

    int ans=-1;

    vvi Xs(3*n+1);
    for(int i=0; i<n; i++)
        Xs[a[i][0]].pb(i);

    fill(t,t+MAXN, 0);
    for(int i=0; i<Xs.size(); i++){
        for(int j=i-1; j>=0; j--){
            for(int maxy:Xs[j]){
                for(int maxx:Xs[i]){
                    if(a[maxx][0]<=a[maxy][0])
                        continue;
                    if(a[maxy][1]<=a[maxx][1])
                        continue;
                    int maxz = qur(0, a[maxy][1]-1);
                    if(maxz<=max(a[maxx][2],a[maxy][2]))
                        continue;

                    ans=max(ans,val[a[maxx][0]] + val[a[maxy][1]] + val[maxz]);
                }
            }
        }
        for(int ix:Xs[i])
            upd(a[ix][1],a[ix][2]);
    }

    out(ans)

}

Compilation message

team.cpp: In function 'void solve()':
team.cpp:122:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int i=0; i<Xs.size(); i++){
      |                  ~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 6 ms 452 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 6 ms 452 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Runtime error 8 ms 3028 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 86 ms 17020 KB Output is correct
12 Correct 44 ms 11468 KB Output is correct
13 Correct 52 ms 13992 KB Output is correct
14 Correct 80 ms 16924 KB Output is correct
15 Correct 86 ms 16948 KB Output is correct
16 Correct 61 ms 17000 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 86 ms 17020 KB Output is correct
12 Correct 44 ms 11468 KB Output is correct
13 Correct 52 ms 13992 KB Output is correct
14 Correct 80 ms 16924 KB Output is correct
15 Correct 86 ms 16948 KB Output is correct
16 Correct 61 ms 17000 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 78 ms 724 KB Output is correct
22 Correct 1690 ms 18236 KB Output is correct
23 Correct 134 ms 17292 KB Output is correct
24 Correct 86 ms 13040 KB Output is correct
25 Correct 106 ms 17852 KB Output is correct
26 Correct 72 ms 17740 KB Output is correct

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 86 ms 17020 KB Output is correct
12 Correct 44 ms 11468 KB Output is correct
13 Correct 52 ms 13992 KB Output is correct
14 Correct 80 ms 16924 KB Output is correct
15 Correct 86 ms 16948 KB Output is correct
16 Correct 61 ms 17000 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 78 ms 724 KB Output is correct
22 Correct 1690 ms 18236 KB Output is correct
23 Correct 134 ms 17292 KB Output is correct
24 Correct 86 ms 13040 KB Output is correct
25 Correct 106 ms 17852 KB Output is correct
26 Correct 72 ms 17740 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 394 ms 1236 KB Output is correct
32 Correct 16 ms 468 KB Output is correct
33 Correct 17 ms 456 KB Output is correct
34 Execution timed out 2086 ms 28584 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 86 ms 17020 KB Output is correct
12 Correct 44 ms 11468 KB Output is correct
13 Correct 52 ms 13992 KB Output is correct
14 Correct 80 ms 16924 KB Output is correct
15 Correct 86 ms 16948 KB Output is correct
16 Correct 61 ms 17000 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 324 KB Output is correct
21 Correct 78 ms 724 KB Output is correct
22 Correct 1690 ms 18236 KB Output is correct
23 Correct 134 ms 17292 KB Output is correct
24 Correct 86 ms 13040 KB Output is correct
25 Correct 106 ms 17852 KB Output is correct
26 Correct 72 ms 17740 KB Output is correct
27 Correct 4 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 394 ms 1236 KB Output is correct
32 Correct 16 ms 468 KB Output is correct
33 Correct 17 ms 456 KB Output is correct
34 Execution timed out 2086 ms 28584 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 6 ms 452 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 3 ms 340 KB Output is correct
18 Correct 3 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Runtime error 8 ms 3028 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -