oj.uz

Submission #431685

# Submission time Handle Problem Language Result Execution time Memory
431685 2021-06-17T14:29:31 Z MDario Seats (IOI18_seats) C++11
17 / 100
 4000 ms 44032 KB 
#include "seats.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> r, c, rmi, rma, cmi, cma, v;
int s=0, n;
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    r=R;
    rmi=R;
    rma=R;
    c=C;
    cmi=C;
    cma=C;
    n=H*W;
    s=1;
    v.push_back(1);
    for(int i=1; i<n; i++){
        rmi[i]=min(r[i], rmi[i-1]);
        rma[i]=max(r[i], rma[i-1]);
        cmi[i]=min(c[i], cmi[i-1]);
        cma[i]=max(c[i], cma[i-1]);
        if((rma[i]-rmi[i]+1)*(cma[i]-cmi[i]+1)==i+1){
            s++;
            v.push_back(1);
        }
        else v.push_back(0);
    }
    return;
}

int swap_seats(int a, int b) {
    if(a>b)swap(a, b);
    swap(r[a], r[b]);
    swap(c[b], c[a]);
    a+=(a==0);
    rmi[0]=r[0];
    rma[0]=r[0];
    cmi[0]=c[0];
    cma[0]=c[0];
    for(int i=a; i<b; i++){
        s-=v[i];
        rmi[i]=min(r[i], rmi[i-1]);
        rma[i]=max(r[i], rma[i-1]);
        cmi[i]=min(c[i], cmi[i-1]);
        cma[i]=max(c[i], cma[i-1]);
        if((rma[i]-rmi[i]+1)*(cma[i]-cmi[i]+1)==i+1){
            s++;
            v[i]=1;
        }
        else v[i]=0;
    }
    return s;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 396 KB Output is correct
12 Correct 3 ms 332 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 396 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 93 ms 800 KB Output is correct
14 Correct 107 ms 800 KB Output is correct
15 Correct 93 ms 716 KB Output is correct
16 Correct 94 ms 808 KB Output is correct
17 Correct 88 ms 812 KB Output is correct
18 Correct 90 ms 836 KB Output is correct
19 Correct 98 ms 820 KB Output is correct
20 Correct 91 ms 816 KB Output is correct
21 Correct 90 ms 816 KB Output is correct
22 Correct 88 ms 820 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4033 ms 43680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 832 KB Output is correct
2 Correct 756 ms 4452 KB Output is correct
3 Correct 1024 ms 43624 KB Output is correct
4 Correct 1000 ms 43684 KB Output is correct
5 Correct 1028 ms 43660 KB Output is correct
6 Correct 983 ms 43636 KB Output is correct
7 Correct 984 ms 43680 KB Output is correct
8 Correct 985 ms 43700 KB Output is correct
9 Correct 993 ms 43672 KB Output is correct
10 Correct 982 ms 43680 KB Output is correct
11 Correct 993 ms 43676 KB Output is correct

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1352 KB Output is correct
2 Correct 20 ms 1328 KB Output is correct
3 Correct 30 ms 1316 KB Output is correct
4 Correct 106 ms 1276 KB Output is correct
5 Correct 901 ms 1876 KB Output is correct
6 Execution timed out 4038 ms 44032 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 3 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 3 ms 332 KB Output is correct
8 Correct 3 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 396 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 93 ms 800 KB Output is correct
14 Correct 107 ms 800 KB Output is correct
15 Correct 93 ms 716 KB Output is correct
16 Correct 94 ms 808 KB Output is correct
17 Correct 88 ms 812 KB Output is correct
18 Correct 90 ms 836 KB Output is correct
19 Correct 98 ms 820 KB Output is correct
20 Correct 91 ms 816 KB Output is correct
21 Correct 90 ms 816 KB Output is correct
22 Correct 88 ms 820 KB Output is correct
23 Execution timed out 4033 ms 43680 KB Time limit exceeded
24 Halted 0 ms 0 KB -