oj.uz

답안 #1046806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046806 2024-08-07T01:44:34 Z nightfal 식물 비교 (IOI20_plants) C++17
100 / 100
 1263 ms 268480 KB 
// #include "plants.h"
#include <iostream>
#include <cstdio>
#include <cassert>
#include <vector>
#include <utility>
#include <algorithm>


// using namespace std;
#define maxVal 1'000'000'001
static std:: vector<int> rank,lz,lzr;
static std:: vector<std::pair<int,int>> t,tr;
static std:: vector<std::vector<int>> g;
static std:: vector<std::vector<std::vector<int>>> power;

static int l,m;
void print(std::pair<int,int> p) {std::cout << "(" << p.first << "," << p.second << ") "; };
void print(std::vector<int> &v) {for(int elem: v) std::cout << elem << " "; std::cout << std::endl;}
void print(std::vector<std::vector<int>> &v) {for (auto elem: v) print(elem); std::cout << std::endl;}
void print(std::vector<std::pair<int,int>> &v) {for(auto [a,b]: v) std::cout << "(" << a << "," << b << ") ";std::cout << std::endl;}
void print(std::vector<std::vector<std::vector<int>>> &v) {for (auto elem: v) print(elem); std::cout << std::endl;}

std::pair<int,int> update(std::vector<std::pair<int,int>> &t, std::vector<int> &lz, int node,int start,int end,int left,int right,int diff) {
    if (left <= start and end <= right) lz[node] += diff;
    if (start!=end) { lz[2*node] += lz[node]; lz[2*node+1] += lz[node];}
    t[node].first += lz[node]; lz[node]=0;
    if (right < start or end < left) return {maxVal,m+1};
    if (left <= start and end <= right) return t[node];

    int mid=(start+end)/2;
    auto ans1  = update(t,lz,2*node,start,mid,left,right,diff);
    auto ans2  = update(t,lz,2*node+1,mid+1,end,left,right,diff);
    auto ans = std::min(ans1,ans2);
    t[node] = std::min(t[2*node],t[2*node+1]);
    return ans;    
}
std::pair<int,int> findMin(std::vector<std::pair<int,int>> &t, std::vector<int> &lz, int node, int start, int end, int left, int right) {
    if (start!=end) {lz[2*node] += lz[node]; lz[2*node+1] += lz[node];}
    t[node].first += lz[node]; lz[node]=0;
    if (right < start or end < left) return {maxVal,m+1};
    if (left <= start and end <= right) return t[node];
    
    int mid=(start+end)/2;
    auto min1 = findMin(t,lz,2*node,start,mid,left,right);
    auto min2 = findMin(t,lz,2*node+1,mid+1,end,left,right);
    auto ans = std::min(min1,min2);
    t[node] = std::min(t[2*node],t[2*node+1]);    
    return ans;
}
void segInit(std::vector<int> &r, std::vector<std::pair<int,int>> &t, int node, int start, int end) {
    if (start==end) {t[node]={r[start],start}; return;}
    int mid=(start+end)/2;
    segInit(r,t, 2*node,start,mid);
    segInit(r,t, 2*node+1,mid+1,end);
    t[node] = std::min(t[2*node],t[2*node+1]);
    return;
}
int findPreMinI(std::vector<std::pair<int,int>> &t, std::vector<int> &lz, int k,int minI1) {
    int ans = minI1;
    if (minI1>0) {
        auto [min2,minI2] = findMin(t,lz,1,0,m-1,std::max(0,minI1-k+1),minI1-1);
        if (min2==0) ans = minI2;
    }
    if (minI1-k+1<0) {
        auto [min2,minI2] = findMin(t,lz,1,0,m-1,minI1-k+1+m,m-1);
        if (min2==0) ans = minI2;
    }
    return ans;
}
int computeRank(std::vector<std::pair<int,int>> &t, std::vector<int> &lz, int minI1, int k, int ranking) {

    if (rank[minI1]!=m) return ranking;
    int minI2 = findPreMinI(t,lz,k,minI1);

    while (minI2 != minI1) {
        ranking = computeRank(t,lz,minI2,k,ranking); 
        minI2 = findPreMinI(t,lz,k,minI1);
    }
    rank[minI1] = ranking--;
    update(t,lz,1,0,m-1,minI1,minI1,m-1);
    if(minI1>0) update(t,lz,1,0,m-1,std::max(0,minI1-k+1),minI1-1,-1);
    if(minI1-k+1<0) update(t,lz,1,0,m-1,minI1-k+1+m,m-1,-1);

    return ranking;
}

// bool inRangeLeft(int z, int y, int left) {return y < z && (z < left || left <= y) || z < y && (z < left && left <= y);}
// bool inRangeRight(int z, int y, int right) {return z < y && (right < z || y <= right) || y < z && (y <= right && right < z);}
bool inRangeNext(int z, int y, int next, int dir) {
    if(dir==0) return y<z && (z<next || next<=y) || z<y && (z<next && next<=y); // next==left
    if(dir==1)  return z<y && (next<z || y<=next) || y<z && (y<=next && next<z); // next==right
}
int compare(int x, int y, int dir) {
    int next, i=0, z=x;
    while(true) {
        next = power[i][z][dir];
        if(next==-1) break;
        if(next==z || inRangeNext(z,y,next,dir)) break;
        i++;
    }
    for(int j=i-1; j>=0; j--) {
        next = power[j][z][dir];
        if(next==-1) continue;
        if(next==z || inRangeNext(z,y,next,dir)) continue;
        else z = next; 
    }
    next = power[0][z][dir];
    if (next!=-1 && inRangeNext(z,y,next,dir) && -rank[z]>-rank[y]) return 1;    
    return 0;
}
int compare(int x, int y) {
    int left, i=0, z=x;
    int found = -1;
    while(true) {
        left = power[i][z][0];
        if(left==-1) break;
        if(left==z || inRangeNext(z,y,left,-1)) break;
        i++;
    }
    for(int j=i-1; j>=0; j--) {
        left = power[j][z][0];
        if(left==-1) continue;
        if(left==z || inRangeNext(z,y,left,-1)) continue;
        else z = left; 
    }
    left = power[0][z][0];
    if (left!=-1 && inRangeNext(z,y,left,-1) && -rank[z]>-rank[y]) return 1;

    int right; 
    i=0; z= x; found = -1;
    while(true) {
        right = power[i][z][1];
        if(right==-1) break;
        if(right==z || inRangeNext(z,y,right,1)) break;
        i++;
    }
    for(int j=i-1; j>=0; j--) {
        right = power[j][z][1];
        if(right==-1) continue;
        if(right==z || inRangeNext(z,y,right,1)) continue;
        else z = right;
    }
    right = power[0][z][1];
    if(right!=-1 && inRangeNext(z,y,right,1) && -rank[z]>-rank[y]) return 1;

    return 0;
}
void calPower() {
    int x = m-1, cnt=1;
    while (x) {x>>=1; cnt++;}
    cnt++;
    power.resize(cnt,std::vector<std::vector<int>>(m,std::vector<int>(2,-1)));
    for(int j=0; j<m; j++)
        for(int x=0; x<2; x++)
            power[0][j][x] = g[j][x];
    
    for (int i=1; i<cnt; i++)
        for(int j=0; j<m; j++)
            for(int x=0; x<2; x++) {
                int  prev = power[i-1][j][x]; 
                int  &next = power[i][j][x];
                if (prev == -1 || prev == j) {next = prev; continue;}
                next = power[i-1][prev][x];
                if (next == -1 or next == j) continue;
                if(x==0 && inRangeNext(j,next,prev,0) || x==1 && inRangeNext(j,next,prev,1))
                // if(x==0 && inRangeLeft(j,next,prev) || x==1 && inRangeRight(j,next,prev))
                next = j;
            }
}
void calReachability(int k) {
    tr.resize(4*m); lzr.resize(4*m);
    std::vector<std::pair<int,int>> rankInv;
    for(int i=0; i<m; i++) {rank[i] = -rank[i]; rankInv.push_back({rank[i],i}); }
    sort(rankInv.begin(),rankInv.end());
    segInit(rank,tr,1,0,m-1);

    g.resize(m,std::vector<int>(2,-1));
    
    for(auto [val,i]: rankInv) {
        std::pair<int,int> temp1 ={maxVal,m+1}, temp2={maxVal,m+1};
        if (i>0) temp1 = findMin(tr,lzr,1,0,m-1,std::max(0,i-k+1),i-1);
        if (i-k+1<0) temp2 = findMin(tr,lzr,1,0,m-1,i-k+1+m,m-1);
        temp1 = std::min(temp1,temp2); 
        if (temp1.first <=0) g[i][0] = temp1.second;

        temp1 ={maxVal,m+1}, temp2={maxVal,m+1};
        if (i+1<m) temp1 = findMin(tr,lzr,1,0,m-1,i+1,std::min(m-1,i+k-1));
        if (i+k-1>m-1) temp2 = findMin(tr,lzr,1,0,m-1,0,i+k-1-m);
        temp1 = std::min(temp1,temp2);
        if (temp1.first <= 0) g[i][1] = temp1.second;
        update(tr,lzr,1,0,m-1,i,i,m);
    }
    calPower();
    return;
}
void init(int k, std::vector<int> r) {
    int n = r.size(); 
    m=n; l=k;
    t.resize(4*n); lz.resize(4*n); 
    segInit(r,t,1,0,n-1);
    rank.resize(n,n);
    int ranking = n-1;
    while (ranking >=0) {
        auto [min1,minI1] = findMin(t,lz,1,0,n-1,0,n-1);
        ranking = computeRank(t,lz,minI1,k,ranking);
    }
    calReachability(k);
	return;
}
int compare_plants(int x, int y) {
    int ans = compare(x,y,0); if (ans) return ans;
    ans = compare(x,y,1); if (ans) return ans;
    ans = compare(y,x,0); if (ans) return -ans;
    return -compare(y,x,1);
}

Compilation message

plants.cpp: In function 'bool inRangeNext(int, int, int, int)':
plants.cpp:91:27: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   91 |     if(dir==0) return y<z && (z<next || next<=y) || z<y && (z<next && next<=y); // next==left
      |                       ~~~~^~~~~~~~~~~~~~~~~~~~~~
plants.cpp:92:28: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   92 |     if(dir==1)  return z<y && (next<z || y<=next) || y<z && (y<=next && next<z); // next==right
      |                        ~~~~^~~~~~~~~~~~~~~~~~~~~~
plants.cpp: In function 'int compare(int, int)':
plants.cpp:114:9: warning: variable 'found' set but not used [-Wunused-but-set-variable]
  114 |     int found = -1;
      |         ^~~~~
plants.cpp: In function 'void calPower()':
plants.cpp:166:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  166 |                 if(x==0 && inRangeNext(j,next,prev,0) || x==1 && inRangeNext(j,next,prev,1))
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
plants.cpp: In function 'bool inRangeNext(int, int, int, int)':
plants.cpp:93:1: warning: control reaches end of non-void function [-Wreturn-type]
   93 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 30 ms 3040 KB Output is correct
7 Correct 121 ms 25808 KB Output is correct
8 Correct 502 ms 266436 KB Output is correct
9 Correct 633 ms 266464 KB Output is correct
10 Correct 695 ms 266436 KB Output is correct
11 Correct 776 ms 266436 KB Output is correct
12 Correct 880 ms 266436 KB Output is correct
13 Correct 880 ms 266608 KB Output is correct
14 Correct 1020 ms 266604 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 54 ms 8520 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 52 ms 8280 KB Output is correct
11 Correct 76 ms 8268 KB Output is correct
12 Correct 142 ms 8464 KB Output is correct
13 Correct 49 ms 8272 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 1372 KB Output is correct
7 Correct 54 ms 8520 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 52 ms 8280 KB Output is correct
11 Correct 76 ms 8268 KB Output is correct
12 Correct 142 ms 8464 KB Output is correct
13 Correct 49 ms 8272 KB Output is correct
14 Correct 108 ms 25808 KB Output is correct
15 Correct 820 ms 266540 KB Output is correct
16 Correct 107 ms 25780 KB Output is correct
17 Correct 875 ms 266436 KB Output is correct
18 Correct 914 ms 266436 KB Output is correct
19 Correct 1222 ms 266548 KB Output is correct
20 Correct 752 ms 266436 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 90 ms 4928 KB Output is correct
4 Correct 1111 ms 267968 KB Output is correct
5 Correct 1096 ms 266692 KB Output is correct
6 Correct 1028 ms 266620 KB Output is correct
7 Correct 920 ms 266552 KB Output is correct
8 Correct 850 ms 266552 KB Output is correct
9 Correct 954 ms 266688 KB Output is correct
10 Correct 1000 ms 266460 KB Output is correct
11 Correct 885 ms 266548 KB Output is correct
12 Correct 1130 ms 266688 KB Output is correct
13 Correct 991 ms 266432 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 11 ms 1112 KB Output is correct
8 Correct 10 ms 1112 KB Output is correct
9 Correct 13 ms 1116 KB Output is correct
10 Correct 10 ms 1112 KB Output is correct
11 Correct 11 ms 1116 KB Output is correct
12 Correct 11 ms 1256 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 753 ms 266552 KB Output is correct
7 Correct 826 ms 266432 KB Output is correct
8 Correct 765 ms 266544 KB Output is correct
9 Correct 864 ms 266476 KB Output is correct
10 Correct 689 ms 266696 KB Output is correct
11 Correct 745 ms 266544 KB Output is correct
12 Correct 768 ms 268480 KB Output is correct
13 Correct 838 ms 266692 KB Output is correct
14 Correct 780 ms 266616 KB Output is correct
15 Correct 839 ms 266432 KB Output is correct
16 Correct 646 ms 266548 KB Output is correct
17 Correct 684 ms 266544 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 30 ms 3040 KB Output is correct
7 Correct 121 ms 25808 KB Output is correct
8 Correct 502 ms 266436 KB Output is correct
9 Correct 633 ms 266464 KB Output is correct
10 Correct 695 ms 266436 KB Output is correct
11 Correct 776 ms 266436 KB Output is correct
12 Correct 880 ms 266436 KB Output is correct
13 Correct 880 ms 266608 KB Output is correct
14 Correct 1020 ms 266604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 54 ms 8520 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 3 ms 1372 KB Output is correct
24 Correct 52 ms 8280 KB Output is correct
25 Correct 76 ms 8268 KB Output is correct
26 Correct 142 ms 8464 KB Output is correct
27 Correct 49 ms 8272 KB Output is correct
28 Correct 108 ms 25808 KB Output is correct
29 Correct 820 ms 266540 KB Output is correct
30 Correct 107 ms 25780 KB Output is correct
31 Correct 875 ms 266436 KB Output is correct
32 Correct 914 ms 266436 KB Output is correct
33 Correct 1222 ms 266548 KB Output is correct
34 Correct 752 ms 266436 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 90 ms 4928 KB Output is correct
38 Correct 1111 ms 267968 KB Output is correct
39 Correct 1096 ms 266692 KB Output is correct
40 Correct 1028 ms 266620 KB Output is correct
41 Correct 920 ms 266552 KB Output is correct
42 Correct 850 ms 266552 KB Output is correct
43 Correct 954 ms 266688 KB Output is correct
44 Correct 1000 ms 266460 KB Output is correct
45 Correct 885 ms 266548 KB Output is correct
46 Correct 1130 ms 266688 KB Output is correct
47 Correct 991 ms 266432 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 11 ms 1112 KB Output is correct
55 Correct 10 ms 1112 KB Output is correct
56 Correct 13 ms 1116 KB Output is correct
57 Correct 10 ms 1112 KB Output is correct
58 Correct 11 ms 1116 KB Output is correct
59 Correct 11 ms 1256 KB Output is correct
60 Correct 8 ms 1116 KB Output is correct
61 Correct 85 ms 4944 KB Output is correct
62 Correct 107 ms 25804 KB Output is correct
63 Correct 586 ms 266432 KB Output is correct
64 Correct 774 ms 266436 KB Output is correct
65 Correct 995 ms 266556 KB Output is correct
66 Correct 924 ms 266432 KB Output is correct
67 Correct 849 ms 266604 KB Output is correct
68 Correct 829 ms 266692 KB Output is correct
69 Correct 914 ms 266436 KB Output is correct
70 Correct 1145 ms 268340 KB Output is correct
71 Correct 1263 ms 266692 KB Output is correct
72 Correct 1046 ms 266436 KB Output is correct
73 Correct 904 ms 266548 KB Output is correct
74 Correct 587 ms 266432 KB Output is correct
75 Correct 832 ms 266436 KB Output is correct