oj.uz

Submission #1043744

# Submission time Handle Problem Language Result Execution time Memory
1043744 2024-08-04T15:46:09 Z nightfal Comparing Plants (IOI20_plants) C++14
60 / 100
 366 ms 17748 KB 
// #include "plants.h"
#include <iostream>
#include <cstdio>
#include <cassert>
#include <vector>
#include <utility>
#include <tuple>
#include <algorithm>



// using namespace std;
#define maxVal 1'000'000'001
static std:: vector<int> inc,dec,rank,lz,lzr,reach,reach2;
static std:: vector<std::pair<int,int>> t,tr;
static std:: vector<std::vector<int>> g, gt, path;
static int l,m,q2,subtask;
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;}

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) {
    if (minI1>0) {
        auto[min2,minI2] = findMin(t,lz,1,0,m-1,std::max(0,minI1-k+1),minI1-1);
        if (min2==0) minI1 = 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) minI1 = minI2;
    }
    return minI1;
}
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);
    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;
}
void reachable(int node, std::vector<std::vector<int>> &g, std::vector<int> &reach) {
    if (node==-1 or reach[node]) return;
    reach[node] = 1;
    for(int elem: g[node])
        reachable(elem,g,reach);
    return;
}
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)); gt.resize(m);
    
    for(auto [val,i]: rankInv) {
        std::pair<int,int> temp1, temp2;
        temp1 = temp2 = 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;gt[temp1.second].push_back(i);}

        temp1 = temp2 = 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;gt[temp1.second].push_back(i);}
        update(tr,lzr,1,0,m-1,i,i,m);
    }

    reach.resize(m); reach2.resize(m);
    reachable(0,g,reach);
    reachable(0,gt,reach2);
    return;
}
void init6(int k, std::vector<int> &r) {
    int n = r.size(); 
    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;
}
void transClosure(int n, int k) {
    for (int i=0; i<n; i++)
        for(int j=i-k+1+n; j<=i+k-1+n; j++)
            if (rank[j%n]<rank[i%n]) g[i][j%n]=1;
        for(int x=0; x<n; x++)
        for (int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                g[i][j] = g[i][j] or g[i][x] and g[x][j];
    
    return;
}
void init5(int k, std::vector<int> &r) {
    int n = r.size(); 
    t.resize(4*n); lz.resize(4*n); g.resize(n,std::vector<int>(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);
    }
    transClosure(n, k);
    return;    
}
void init4(int k, std::vector<int> &r) {
    int n = r.size(); 
    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);
    }
    return;
}
void init3(int k, std::vector<int> &r) {
    int n = r.size(); 
    t.resize(4*n); lz.resize(4*n);
    segInit(r,t,1,0,n-1);
    rank.resize(n,n);

    for(int i=n-1; i>=0; i--) {
        auto [min1,minI1] = findMin(t,lz,1,0,n-1,0,n-1);
        int min2=1, minI2=minI1;
        int min3=1, minI3=minI1;
        if (minI1>0) std::tie(min2,minI2) = findMin(t,lz,1,0,n-1,std::max(0,minI1-(n-k)),minI1-1);
        if (minI1-(n-k)<0) std::tie(min3,minI3) = findMin(t,lz,1,0,n-1,minI1-(n-k)+n,n-1);
        if (min3==0) minI1=minI3;
        else if (min2==0) minI1=minI2;
        rank[minI1] = i;
        update(t,lz,1,0,n-1,minI1,minI1,n-1);
        update(t,lz,1,0,n-1,std::max(0,minI1-k+1),minI1-1,-1);
        if (minI1-k+1<0) update(t,lz,1,0,n-1,minI1-k+1+n,n-1,-1);
    }
    return;
}
int findMax(int k, std::vector<int> &r) {
    int i=2*m-1;
    while (r[i%m]!=0) {i--;}
    int j = i-1;
    while (j > i-k) {
        if (r[j%m]==0) i = j; 
        j--;
    }
    for(int j=i; j>i-k; j--) r[j%m]--;
    return i%m;
}
void init2(int k, std::vector<int> &r) {
    int n = r.size();
    rank.resize(n);
    for(int i=n-1; i>=0; i--)
        rank[findMax(k,r)] = i;   
    return;
}
void init1(int k, std::vector<int> &r) {
    int n = r.size();
    inc.resize(n); dec.resize(n);
    for(int i=0; i<n; i++) {inc[i] = dec[i] = i;}
    int s,incVal,decVal;
    for(s=2*n-1; s>=0; s--) {
        if (r[s%n]==0) incVal = s;
        else decVal = s;
        inc[s%n] = incVal; dec[s%n] = decVal;
    }
    return;
}
void init(int k, std::vector<int> r) {
    int n = r.size(); 
    m=n; l=k;

    // init6(k,r); return;
	if(k==2) init1(k, r);
    else if(n<=5000 and 2*k>n) init2(k, r);
    else if(2*k>n) init3(k,r);
    else if (n<=300 and q2 <= n*(n-1)/2) init5(k,r);
    else init4(k,r);
	return;
}
int compare_plants6(int x, int y) {
    if (reach[y]) return 1;
    else if (reach2[y]) return -1;
    else return 0;
}
int compare_plants5(int x, int y) {
    if (g[x][y]) return 1;
    else if (g[y][x]) return -1;
    else return 0;
}
int compare_plants2(int x, int y) {
    if (rank[x]>rank[y]) return 1;
    else return -1;
}
int compare_plants1(int x, int y) {
    if (y <= dec[x] or x+m <= inc[y]) return 1;
    else if (y <= inc[x] or x+m <= dec[y]) return -1;
	return 0;
}
int compare_plants(int x, int y) {
    // return compare_plants6(x,y);
  	if(l==2) return compare_plants1(x,y);
    else if(m<=5000 and 2*l>m) return compare_plants2(x,y);
    else if(2*l>m) return compare_plants2(x,y);
    if (m<=300 and q2 <= m*(m-1)/2) return compare_plants5(x,y);
    else return compare_plants2(x,y);
	return 0;
}

Compilation message

plants.cpp: In function 'void print(std::vector<std::pair<int, int> >&)':
plants.cpp:21:58: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 | void print(std::vector<std::pair<int,int>> &v) {for(auto [a,b]: v) std::cout << "(" << a << "," << b << ") ";std::cout << std::endl;}
      |                                                          ^
plants.cpp: In function 'int findPreMinI(std::vector<std::pair<int, int> >&, std::vector<int>&, int, int)':
plants.cpp:60:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   60 |         auto[min2,minI2] = findMin(t,lz,1,0,m-1,std::max(0,minI1-k+1),minI1-1);
      |             ^
plants.cpp:64:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |         auto[min2,minI2] = findMin(t,lz,1,0,m-1,minI1-k+1+m,m-1);
      |             ^
plants.cpp: In function 'void calReachability(int)':
plants.cpp:101:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  101 |     for(auto [val,i]: rankInv) {
      |              ^
plants.cpp: In function 'void init6(int, std::vector<int>&)':
plants.cpp:127:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  127 |         auto [min1,minI1] = findMin(t,lz,1,0,n-1,0,n-1);
      |              ^
plants.cpp: In function 'void transClosure(int, int)':
plants.cpp:134:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  134 |     for (int i=0; i<n; i++)
      |     ^~~
plants.cpp:137:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  137 |         for(int x=0; x<n; x++)
      |         ^~~
plants.cpp:140:46: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  140 |                 g[i][j] = g[i][j] or g[i][x] and g[x][j];
plants.cpp: In function 'void init5(int, std::vector<int>&)':
plants.cpp:151:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  151 |         auto [min1,minI1] = findMin(t,lz,1,0,n-1,0,n-1);
      |              ^
plants.cpp: In function 'void init4(int, std::vector<int>&)':
plants.cpp:165:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  165 |         auto [min1,minI1] = findMin(t,lz,1,0,n-1,0,n-1);
      |              ^
plants.cpp: In function 'void init3(int, std::vector<int>&)':
plants.cpp:177:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  177 |         auto [min1,minI1] = findMin(t,lz,1,0,n-1,0,n-1);
      |              ^
plants.cpp: At global scope:
plants.cpp:17:19: warning: 'subtask' defined but not used [-Wunused-variable]
   17 | static int l,m,q2,subtask;
      |                   ^~~~~~~
plants.cpp: In function 'void init1(int, std::vector<int>&)':
plants.cpp:217:37: warning: 'decVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  217 |         inc[s%n] = incVal; dec[s%n] = decVal;
plants.cpp:217:18: warning: 'incVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  217 |         inc[s%n] = incVal; dec[s%n] = decVal;

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 28 ms 3052 KB Output is correct
7 Correct 31 ms 3420 KB Output is correct
8 Correct 44 ms 8788 KB Output is correct
9 Correct 50 ms 8816 KB Output is correct
10 Correct 40 ms 8788 KB Output is correct
11 Correct 45 ms 8788 KB Output is correct
12 Correct 40 ms 8780 KB Output is correct
13 Correct 38 ms 8788 KB Output is correct
14 Correct 41 ms 8796 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 113 ms 4432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 116 ms 4584 KB Output is correct
11 Correct 88 ms 4436 KB Output is correct
12 Correct 89 ms 4628 KB Output is correct
13 Correct 131 ms 4432 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 113 ms 4432 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 116 ms 4584 KB Output is correct
11 Correct 88 ms 4436 KB Output is correct
12 Correct 89 ms 4628 KB Output is correct
13 Correct 131 ms 4432 KB Output is correct
14 Correct 52 ms 5712 KB Output is correct
15 Correct 332 ms 16572 KB Output is correct
16 Correct 50 ms 5496 KB Output is correct
17 Correct 310 ms 16468 KB Output is correct
18 Correct 224 ms 16208 KB Output is correct
19 Correct 223 ms 16464 KB Output is correct
20 Correct 253 ms 16724 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 28 ms 3316 KB Output is correct
4 Correct 202 ms 17748 KB Output is correct
5 Correct 229 ms 16460 KB Output is correct
6 Correct 286 ms 16220 KB Output is correct
7 Correct 349 ms 16464 KB Output is correct
8 Correct 366 ms 16464 KB Output is correct
9 Correct 196 ms 16208 KB Output is correct
10 Correct 194 ms 16328 KB Output is correct
11 Correct 38 ms 7672 KB Output is correct
12 Correct 173 ms 16208 KB Output is correct
13 Correct 233 ms 16320 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory 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 2 ms 348 KB Output is correct
7 Correct 31 ms 1344 KB Output is correct
8 Correct 39 ms 1344 KB Output is correct
9 Correct 31 ms 1364 KB Output is correct
10 Correct 38 ms 1360 KB Output is correct
11 Correct 31 ms 1372 KB Output is correct
12 Correct 34 ms 1340 KB Output is correct
13 Correct 6 ms 856 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 2 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 28 ms 3052 KB Output is correct
7 Correct 31 ms 3420 KB Output is correct
8 Correct 44 ms 8788 KB Output is correct
9 Correct 50 ms 8816 KB Output is correct
10 Correct 40 ms 8788 KB Output is correct
11 Correct 45 ms 8788 KB Output is correct
12 Correct 40 ms 8780 KB Output is correct
13 Correct 38 ms 8788 KB Output is correct
14 Correct 41 ms 8796 KB Output is correct
15 Correct 0 ms 344 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 5 ms 348 KB Output is correct
21 Correct 113 ms 4432 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 116 ms 4584 KB Output is correct
25 Correct 88 ms 4436 KB Output is correct
26 Correct 89 ms 4628 KB Output is correct
27 Correct 131 ms 4432 KB Output is correct
28 Correct 52 ms 5712 KB Output is correct
29 Correct 332 ms 16572 KB Output is correct
30 Correct 50 ms 5496 KB Output is correct
31 Correct 310 ms 16468 KB Output is correct
32 Correct 224 ms 16208 KB Output is correct
33 Correct 223 ms 16464 KB Output is correct
34 Correct 253 ms 16724 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 28 ms 3316 KB Output is correct
38 Correct 202 ms 17748 KB Output is correct
39 Correct 229 ms 16460 KB Output is correct
40 Correct 286 ms 16220 KB Output is correct
41 Correct 349 ms 16464 KB Output is correct
42 Correct 366 ms 16464 KB Output is correct
43 Correct 196 ms 16208 KB Output is correct
44 Correct 194 ms 16328 KB Output is correct
45 Correct 38 ms 7672 KB Output is correct
46 Correct 173 ms 16208 KB Output is correct
47 Correct 233 ms 16320 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 2 ms 348 KB Output is correct
54 Correct 31 ms 1344 KB Output is correct
55 Correct 39 ms 1344 KB Output is correct
56 Correct 31 ms 1364 KB Output is correct
57 Correct 38 ms 1360 KB Output is correct
58 Correct 31 ms 1372 KB Output is correct
59 Correct 34 ms 1340 KB Output is correct
60 Correct 6 ms 856 KB Output is correct
61 Incorrect 28 ms 4944 KB Output isn't correct
62 Halted 0 ms 0 KB -