Submission #799353

#	Time	Username	Problem	Language	Result	Execution time	Memory
799353		BidoTeima	Sticks (POI11_pat)	C++17	28 / 100	402 ms	48868 KiB

pat

#include <bits/stdc++.h> 
typedef long long ll;
using namespace std;  
const int N = 1e6;
vector<int>mn,mx;
vector<short>color;
ll st[4 * N];
void build(int l, int r, int node){
    if(l == r){
        st[node] = 1<<color[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, 2 * node + 1);
    build(mid + 1, r, 2 * node + 2);
    st[node] = st[2 * node + 1] | st[2 * node + 2];
}
ll query(int ql, int qr, int l, int r, int node){
    if(l > qr || r < ql)
        return 0;
    if(ql <= l && r <= qr){
        return st[node];
    }
    int mid = (l + r) >> 1;
    return query(ql, qr, l, mid, 2 * node + 1) | query(ql, qr, mid + 1, r, 2 * node + 2);
}
int main() {      
    int k;
    cin>>k;
    vector<pair<int,short>>arr;
    for(int i = 0; i < k; i++){
        int n;
        cin>>n;
        for(int j = 0; j < n; j++){
            int w;
            cin>>w;
            arr.push_back(make_pair(w, i));
        }
    }
    sort(arr.begin(), arr.end()); 
    int curmn=arr[0].first,curmx=arr[0].first,curc=arr[0].second;
    for(int i = 1; i < (int)arr.size(); i++){
        if(arr[i].second != arr[i - 1].second){
            mn.push_back(curmn);
            mx.push_back(curmx);
            color.push_back(curc);
            curmn=curmx=arr[i].first,curc=arr[i].second;
        }
    }
    mn.push_back(curmn);
    mx.push_back(curmx);
    color.push_back(curc);
    int n = (int)color.size();
    build(0, n - 1, 0);
    int r = 2;
    for(int i = 0; i + 2 < n; i++){ 
        if(__builtin_popcount(query(i, n - 1, 0, n - 1, 0)) < 3)break;
        while(__builtin_popcount(query(i, r, 0, n - 1, 0)) < 3){
            r++;
        }
        //i,i+1,r
        if(mx[i]+mx[i+1]>mn[r]){
            return cout<<color[i]+1<<' '<<mx[i]<<' '<<color[i+1]+1<<' '<<mx[i+1]<<' '<<color[r]+1<<' '<<mn[r], 0;
        }
    }
    cout<<"NIE";
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8
• Subtask 13: 0 / 8