oj.uz

Submission #303223

# Submission time Handle Problem Language Result Execution time Memory
303223 2020-09-20T02:56:47 Z qiangbao Comparing Plants (IOI20_plants) C++14
14 / 100
 4000 ms 5112 KB 
#include <iostream>
#include <vector>
#include <set>
#include "plants.h"

#define pb push_back

using namespace std;

int n;

set<int> zero;
set<int> cur;
set<int>:: iterator it, it2;

int ans[200001];

void init(int k, vector<int> r)
{
    int i, j;
    n=r.size();
    
    for(i=0;i<n;i++)
        r[i]=k-1-r[i];
    for(i=0;i<n;i++)
        if(r[i]==0)
            zero.insert(i);
    for(i=1;i<=n;i++){
        cur.clear();
        it=zero.begin();
        while(it!=zero.end()){
            cur.insert(*it), cur.insert(*it+n);
            it++;
        }
        it=cur.begin();
        while(it!=cur.end()){
            it2=it, it2++;
            if(it2==cur.end())
                break;
            if(*it2-*it<k){
                cur.erase(*it2);
                cur.erase(*it2+n);
            }
            else
                it++;
        }
        it=cur.begin();
        while(it!=cur.end()){
            int f=*it;
            if(f<n){
                it++;
                continue;
            }
            f-=n;
            ans[f]=i;
            zero.erase(f);
            for(j=0;j<k;j++){
                int f2=(f-j);
                if(f2<0)
                    f2+=n;
                r[f2]--;
                if(r[f2]==0)
                    zero.insert(f2);
            }
            it++;
        }
    }
}

int compare_plants(int x, int y)
{
    if(ans[x]==ans[y])
        return 0;
    else if(ans[x]>ans[y])
        return 1;
    return -1;
}

//int main()
//{
//    int nn;
//    vector<int> in, in2;
//    int i, j;
//
//    cin >> nn;
//    for(i=0;i<nn;i++){
//        int x;
//        cin >> x;
//        in.pb(x), in2.pb(0);
//    }
//
//    for(i=0;i<nn;i++)
//        for(j=1;j<4;j++){
//            int f=(i+j)%nn;
//            if(in[i]<in[f])
//                in2[i]++;
//        }
//
//    init(4, in2);
//    for(i=0;i<n;i++)
//        cout << ans[i] << " ";
//    cout << endl;
//
//    return 0;
//}

//7
// 4 3 5 7 6 1 2

Subtask #1
0 / 5.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 155 ms 3320 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 155 ms 3192 KB Output is correct
11 Correct 111 ms 3092 KB Output is correct
12 Correct 3213 ms 3764 KB Output is correct
13 Correct 176 ms 3192 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 155 ms 3320 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 155 ms 3192 KB Output is correct
11 Correct 111 ms 3092 KB Output is correct
12 Correct 3213 ms 3764 KB Output is correct
13 Correct 176 ms 3192 KB Output is correct
14 Correct 918 ms 3484 KB Output is correct
15 Execution timed out 4086 ms 5112 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 76 ms 3296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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