oj.uz

Submission #1042918

# Submission time Handle Problem Language Result Execution time Memory
1042918 2024-08-03T14:42:34 Z nightfal Comparing Plants (IOI20_plants) C++17
11 / 100
 41 ms 5584 KB 
// #include "plants.h"
#include <iostream>
#include <cstdio>
#include <cassert>
#include <vector>
#include <utility>
#include <tuple>



// using namespace std;
#define maxVal 1'000'000'001
static std:: vector<int> inc,dec,rank,lz;
static std:: vector<std::pair<int,int>> t;
static std:: vector<std::vector<int>> g, path;
static int l,m,q2;
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(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 min1  = update(2*node,start,mid,left,right,diff);
    auto min2  = update(2*node+1,mid+1,end,left,right,diff);
    auto ans = min1<min2? min1:min2;
    t[node] = t[2*node]<t[2*node+1]? t[2*node]:t[2*node+1];    
    return ans;    
}
std::pair<int,int> findMin(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(2*node,start,mid,left,right);
    auto min2 = findMin(2*node+1,mid+1,end,left,right);
    auto ans = min1<min2? min1:min2;
    t[node] = t[2*node]<t[2*node+1]? t[2*node]:t[2*node+1];    
    return ans;
}
void segInit(int node, int start, int end, std::vector<int> &r) {
    if (start==end) {t[node]={r[start],start}; return;}
    int mid=(start+end)/2;
    segInit(2*node,start,mid,r);
    segInit(2*node+1,mid+1,end,r);
    t[node] = t[2*node]<t[2*node+1]? t[2*node]:t[2*node+1];
    return;
}
int findPreMinI(int k,int minI1) {
    if (minI1>0) {
        auto[min2,minI2] = findMin(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(1,0,m-1,minI1-k+1+m,m-1);
        if (min2==0) minI1 = minI2;
    }
    return minI1;
}
int computeRank(int minI1, int k, int ranking) {

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

    while (minI2 != minI1) {
        ranking = computeRank(minI2,k,ranking); 
        minI2 = findPreMinI(k,minI1);
    }
    rank[minI1] = ranking--;
    for(int i=minI1-k+1+m; i<=minI1+k-1+m; i++)
        if (rank[i%m]==m) g[minI1][i%m]=1;
        
    update(1,0,m-1,minI1,minI1,m-1);
    update(1,0,m-1,std::max(0,minI1-k+1),minI1-1,-1);
    if (minI1-k+1<0) update(1,0,m-1,minI1-k+1+m,m-1,-1);

    return ranking;
}
void transClosure() {
    for(int k=0; k<m; k++)
        for (int i=0; i<m; i++)
            for(int j=0; j<m; j++)
                g[i][j] = g[i][j] or g[i][k] and g[k][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(1,0,n-1,r);
    rank.resize(n,n);
    int ranking = n-1;
    while (ranking >=0) {
        auto [min1,minI1] = findMin(1,0,n-1,0,n-1);
        ranking = computeRank(minI1,k,ranking);
        // for(int i=minI1-k+1+n; i<=minI1+k-1+n; i++) {
        //     if (rank[i%n]==n) g[minI1][i%n]=1;
        // }
    }
    // std::cout << "ranking: " << ranking << std::endl;
    // std::cout << "rank: "; print(rank);
    // std::cout << "g" << std::endl; print(g);
    transClosure();
    // std::cout << "transclosure" << std::endl; print(g);
    return;    
}

void init4(int k, std::vector<int> &r) {
    int n = r.size(); 
    t.resize(4*n); lz.resize(4*n);
    segInit(1,0,n-1,r);
    rank.resize(n,n);
    int ranking = n-1;
    while (ranking >=0) {
        auto [min1,minI1] = findMin(1,0,n-1,0,n-1);
        ranking = computeRank(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(1,0,n-1,r);
    rank.resize(n);
    for(int i=n-1; i>=0; i--) {
        auto [min1,minI1] = findMin(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(1,0,n-1,std::max(0,minI1-(n-k)),minI1-1);
        if (minI1-(n-k)<0) std::tie(min3,minI3) = findMin(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(1,0,n-1,minI1,minI1,n-1);
        update(1,0,n-1,std::max(0,minI1-k+1),minI1-1,-1);
        if (minI1-k+1<0) update(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;
	if(false and 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_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) {
  	if(false and 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);
    else 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 transClosure()':
plants.cpp:90:46: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   90 |                 g[i][j] = g[i][j] or g[i][k] and g[k][j];
plants.cpp: In function 'void init1(int, std::vector<int>&)':
plants.cpp:172:37: warning: 'decVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  172 |         inc[s%n] = incVal; dec[s%n] = decVal;
plants.cpp:172:18: warning: 'incVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  172 |         inc[s%n] = incVal; dec[s%n] = decVal;

Subtask #1
0 / 5.0

# Verdict Execution time Memory 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 31 ms 4064 KB Output is correct
7 Incorrect 34 ms 5584 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.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 Incorrect 27 ms 4772 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
11.0 / 11.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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 32 ms 1628 KB Output is correct
8 Correct 41 ms 1656 KB Output is correct
9 Correct 33 ms 1624 KB Output is correct
10 Correct 41 ms 1624 KB Output is correct
11 Correct 38 ms 1628 KB Output is correct
12 Correct 40 ms 1720 KB Output is correct
13 Correct 40 ms 1628 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 0 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 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 31 ms 4064 KB Output is correct
7 Incorrect 34 ms 5584 KB Output isn't correct
8 Halted 0 ms 0 KB -