oj.uz

Submission #348292

# Submission time Handle Problem Language Result Execution time Memory
348292 2021-01-14T13:48:39 Z beksultan04 Seats (IOI18_seats) C++14
11 / 100
 1712 ms 37996 KB 
#include "seats.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
pii p[N];
int n;
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    int i;
    n = H*W;
    for (i=0;i<n;++i)
        p[i] = {R[i],C[i]};
}

int swap_seats(int a, int b) {
    swap(p[a],p[b]);
    int x1=INF,y1=INF,x2=0,y2=0,i,ans=0;
    for (i=0;i<n;++i){
        x1 = min(x1,p[i].fr);
        y1 = min(y1,p[i].sc);
        x2 = max(x2,p[i].fr);
        y2 = max(y2,p[i].sc);
        int x = x2-x1+1;
        int y = y2-y1+1;
        int z = x*y-1;
        if (z == i){
            ans ++;
        }
    }


    return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 4 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 4 ms 492 KB Output is correct
9 Correct 4 ms 492 KB Output is correct
10 Correct 4 ms 620 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
13 Correct 177 ms 748 KB Output is correct
14 Correct 174 ms 620 KB Output is correct
15 Correct 172 ms 620 KB Output is correct
16 Correct 175 ms 748 KB Output is correct
17 Correct 174 ms 748 KB Output is correct
18 Correct 172 ms 620 KB Output is correct
19 Correct 177 ms 748 KB Output is correct
20 Correct 182 ms 768 KB Output is correct
21 Correct 173 ms 620 KB Output is correct
22 Correct 175 ms 748 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 322 ms 37100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 784 KB Output is correct
2 Correct 1577 ms 2412 KB Output is correct
3 Runtime error 303 ms 37100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1384 KB Output is correct
2 Correct 20 ms 1384 KB Output is correct
3 Correct 36 ms 1384 KB Output is correct
4 Correct 191 ms 1512 KB Output is correct
5 Correct 1712 ms 1668 KB Output is correct
6 Runtime error 322 ms 37996 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 4 ms 492 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 4 ms 492 KB Output is correct
9 Correct 4 ms 492 KB Output is correct
10 Correct 4 ms 620 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
13 Correct 177 ms 748 KB Output is correct
14 Correct 174 ms 620 KB Output is correct
15 Correct 172 ms 620 KB Output is correct
16 Correct 175 ms 748 KB Output is correct
17 Correct 174 ms 748 KB Output is correct
18 Correct 172 ms 620 KB Output is correct
19 Correct 177 ms 748 KB Output is correct
20 Correct 182 ms 768 KB Output is correct
21 Correct 173 ms 620 KB Output is correct
22 Correct 175 ms 748 KB Output is correct
23 Runtime error 322 ms 37100 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -