oj.uz

답안 #1042381

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042381 2024-08-03T03:13:46 Z nightfal 식물 비교 (IOI20_plants) C++17
32 / 100
 339 ms 18260 KB 
#include "plants.h"
#include <iostream>


#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 int l,m;
// void print(std::vector<int> &v) {for(int elem: v) std::cout << elem << " "; std::cout << std::endl;}
void print(std::vector<int> &v) {for(int elem: v) std::cout << 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;
    return;
}
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].second += lz[node]; lz[node]=0;
    if (right < start or end < left) return {m+1,maxVal};
    if (left <= start and end <= right) return t[node];

    int mid=(start+end)/2;
    int minI1,minI2,min1,min2;
    std::pair<int,int> ans;

    std::tie(minI1,min1) = update(2*node,start,mid,left,right,diff);
    std::tie(minI2,min2) = update(2*node+1,mid+1,end,left,right,diff);
    if (min1<min2 or min1==min2 and minI1 < minI2) ans = {minI1,min1};
    else ans = {minI2,min2};

    std::tie(minI1,min1) = t[2*node]; 
    std::tie(minI2,min2) = t[2*node+1];
    if (min1<min2 or min1==min2 and minI1 < minI2) t[node] = t[2*node];
    else t[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].second += lz[node]; lz[node]=0;
    if (right < start or end < left) return {m+1,maxVal};
    if (left <= start and end <= right) return t[node];
    
    int mid=(start+end)/2;
    int minI1,minI2,min1,min2;
    std::pair<int,int> ans;
    
    std::tie(minI1,min1) = findMin(2*node,start,mid,left,right);
    std::tie(minI2,min2) = findMin(2*node+1,mid+1,end,left,right);
    if (min1<min2 or min1==min2 and minI1 < minI2) ans = {minI1,min1};
    else ans = {minI2,min2};
    
    std::tie(minI1,min1) = t[2*node]; 
    std::tie(minI2,min2) = t[2*node+1];
    if (min1<min2 or min1==min2 and minI1 < minI2) t[node] = t[2*node];
    else t[node] = t[2*node+1];
    return ans;
}
void segInit(int node, int start, int end, std::vector<int> &r) {
    if (start==end) {t[node]={start,r[start]}; return;}
    int mid=(start+end)/2;
    segInit(2*node,start,mid,r);
    segInit(2*node+1,mid+1,end,r);
    auto [minI1,min1] = t[2*node];
    auto [minI2,min2] = t[2*node+1];
    t[node] = min1<min2 or min1==min2 and minI1<minI2? t[2*node]:t[2*node+1];
    return;
}
void init3(int k, std::vector<int> &r) {
    int n = r.size(); 
    //r.push_back(maxVal);
    t.resize(4*n); lz.resize(4*n);
    segInit(1,0,n-1,r);
    // print(r); print(t);
    rank.resize(n);
    for(int i=n-1; i>=0; i--) {
        auto [minI1,min1] = findMin(1,0,n-1,0,n-1);
        // std::cout << "minI1: " << minI1 << std::endl;
        // std:: cout << "t" << std::endl; print(t);
        int minI2=minI1,min2=1;
        int minI3=minI1,min3=1;
        if (minI1>0) std::tie(minI2,min2) = findMin(1,0,n-1,std::max(0,minI1-(n-k)),minI1-1);
        if (minI1-(n-k)<0) std::tie(minI3,min3) = findMin(1,0,n-1,minI1-(n-k)+n,n-1);
        if (min3==0) minI1=minI3;
        else if (min2==0) minI1=minI2;
        // std::cout << "minI1: " << minI1 << std::endl;
        // print(t);
        rank[minI1] = i;
        // std::cout << "rank: "; print(rank);
        update(1,0,n-1,minI1,minI1,n-1);
        // std::cout << "t" << std::endl; print(t);
        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);
        // std::cout << "minI1-k+1: " << minI1-k+1 << std::endl;
        // std::cout << "t" << std::endl; print(t);
        // std::cout << "lz" << std::endl; print(lz);
    }
    return;
}
int compare_plants3(int x, int y) {
    if (rank[x]>rank[y]) return 1;
    else return -1;
}
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;
}
int compare_plants2(int x, int y) {
    if (rank[x]>rank[y]) return 1;
    else return -1;
}
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;
}
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;
}
void init(int k, std::vector<int> r) {
    int n = r.size(); 
    m=n; l=k;
	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);
	return;
}
int compare_plants(int x, int 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_plants3(x,y);
	return 0;
}

Compilation message

plants.cpp: In function 'std::pair<int, int> update(int, int, int, int, int, int)':
plants.cpp:33:33: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   33 |     if (min1<min2 or min1==min2 and minI1 < minI2) ans = {minI1,min1};
      |                      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~
plants.cpp:38:33: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   38 |     if (min1<min2 or min1==min2 and minI1 < minI2) t[node] = t[2*node];
      |                      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~
plants.cpp: In function 'std::pair<int, int> findMin(int, int, int, int, int)':
plants.cpp:55:33: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   55 |     if (min1<min2 or min1==min2 and minI1 < minI2) ans = {minI1,min1};
      |                      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~
plants.cpp:60:33: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   60 |     if (min1<min2 or min1==min2 and minI1 < minI2) t[node] = t[2*node];
      |                      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~
plants.cpp: In function 'void segInit(int, int, int, std::vector<int>&)':
plants.cpp:71:39: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   71 |     t[node] = min1<min2 or min1==min2 and minI1<minI2? t[2*node]:t[2*node+1];
      |                            ~~~~~~~~~~~^~~~~~~~~~~~~~~
plants.cpp: In function 'void init1(int, std::vector<int>&)':
plants.cpp:140:37: warning: 'decVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  140 |         inc[s%n] = incVal; dec[s%n] = decVal;
plants.cpp:140:18: warning: 'incVal' may be used uninitialized in this function [-Wmaybe-uninitialized]
  140 |         inc[s%n] = incVal; dec[s%n] = decVal;

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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 25 ms 4164 KB Output is correct
7 Correct 31 ms 5724 KB Output is correct
8 Correct 40 ms 8788 KB Output is correct
9 Correct 41 ms 8812 KB Output is correct
10 Correct 46 ms 8648 KB Output is correct
11 Correct 39 ms 8788 KB Output is correct
12 Correct 40 ms 8784 KB Output is correct
13 Correct 45 ms 8784 KB Output is correct
14 Correct 41 ms 8796 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 114 ms 5000 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 113 ms 5204 KB Output is correct
11 Correct 88 ms 4972 KB Output is correct
12 Correct 89 ms 5240 KB Output is correct
13 Correct 133 ms 4980 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 114 ms 5000 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 113 ms 5204 KB Output is correct
11 Correct 88 ms 4972 KB Output is correct
12 Correct 89 ms 5240 KB Output is correct
13 Correct 133 ms 4980 KB Output is correct
14 Correct 50 ms 6444 KB Output is correct
15 Correct 339 ms 18248 KB Output is correct
16 Correct 62 ms 6568 KB Output is correct
17 Correct 316 ms 18000 KB Output is correct
18 Correct 240 ms 17828 KB Output is correct
19 Correct 221 ms 18260 KB Output is correct
20 Correct 252 ms 18260 KB Output is correct

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #7
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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 25 ms 4164 KB Output is correct
7 Correct 31 ms 5724 KB Output is correct
8 Correct 40 ms 8788 KB Output is correct
9 Correct 41 ms 8812 KB Output is correct
10 Correct 46 ms 8648 KB Output is correct
11 Correct 39 ms 8788 KB Output is correct
12 Correct 40 ms 8784 KB Output is correct
13 Correct 45 ms 8784 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 114 ms 5000 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 113 ms 5204 KB Output is correct
25 Correct 88 ms 4972 KB Output is correct
26 Correct 89 ms 5240 KB Output is correct
27 Correct 133 ms 4980 KB Output is correct
28 Correct 50 ms 6444 KB Output is correct
29 Correct 339 ms 18248 KB Output is correct
30 Correct 62 ms 6568 KB Output is correct
31 Correct 316 ms 18000 KB Output is correct
32 Correct 240 ms 17828 KB Output is correct
33 Correct 221 ms 18260 KB Output is correct
34 Correct 252 ms 18260 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Incorrect 0 ms 348 KB Output isn't correct
37 Halted 0 ms 0 KB -