oj.uz

Submission #417859

# Submission time Handle Problem Language Result Execution time Memory
417859 2021-06-04T12:33:54 Z ioi Seats (IOI18_seats) C++14
5 / 100
 4000 ms 43676 KB 
#include "seats.h"
#include<bits/stdc++.h>
using namespace std ;


vector<vector<int> > matrix ;

vector<int> r , c ;
int h , w ;

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
    r = R , c = C ;
    h = H , w = W ;

    matrix.resize(H);
    for(int i = 0 ;i < H ; i ++)matrix[i].resize(W);

    for(int i = 0 ; i < H * W ; i ++)
        matrix[R[i]][C[i]] = i  ;




}

int swap_seats(int a, int b) {


    swap(matrix[r[a]][c[a]] , matrix[r[b]][c[b]]);

    swap(r[a] , r[b]);
    swap(c[a] , c[b]);

    int ans = 0 ;


    for(int i = 0 ; i < h ; i ++ ){
        for(int j = 0 ; j < w ; j ++ ){

            for(int er = i ; er < h ; er ++){

                for(int ec = j ; ec < w ; ec ++){


                    long long  sum = 0 ;

                    for(int ii = i ; ii <= er ; ii ++)
                        for(int jj = j ; jj <= ec ; jj ++)
                            sum += matrix[ii][jj];
                    long long sz = (ec - j + 1) * (er - i + 1);
                    if(sum == sz * (sz - 1) / 2)ans ++ ;
                }
            }

        }
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 392 KB Output is correct
2 Correct 28 ms 428 KB Output is correct
3 Correct 342 ms 388 KB Output is correct
4 Correct 759 ms 452 KB Output is correct
5 Correct 1205 ms 552 KB Output is correct
6 Correct 475 ms 420 KB Output is correct
7 Correct 394 ms 452 KB Output is correct
8 Correct 319 ms 332 KB Output is correct
9 Correct 340 ms 504 KB Output is correct
10 Correct 465 ms 556 KB Output is correct
11 Correct 608 ms 520 KB Output is correct
12 Correct 766 ms 452 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 392 KB Output is correct
2 Correct 28 ms 428 KB Output is correct
3 Correct 342 ms 388 KB Output is correct
4 Correct 759 ms 452 KB Output is correct
5 Correct 1205 ms 552 KB Output is correct
6 Correct 475 ms 420 KB Output is correct
7 Correct 394 ms 452 KB Output is correct
8 Correct 319 ms 332 KB Output is correct
9 Correct 340 ms 504 KB Output is correct
10 Correct 465 ms 556 KB Output is correct
11 Correct 608 ms 520 KB Output is correct
12 Correct 766 ms 452 KB Output is correct
13 Execution timed out 4053 ms 716 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

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

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1992 KB Output is correct
2 Correct 36 ms 1956 KB Output is correct
3 Execution timed out 4094 ms 1568 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 392 KB Output is correct
2 Correct 28 ms 428 KB Output is correct
3 Correct 342 ms 388 KB Output is correct
4 Correct 759 ms 452 KB Output is correct
5 Correct 1205 ms 552 KB Output is correct
6 Correct 475 ms 420 KB Output is correct
7 Correct 394 ms 452 KB Output is correct
8 Correct 319 ms 332 KB Output is correct
9 Correct 340 ms 504 KB Output is correct
10 Correct 465 ms 556 KB Output is correct
11 Correct 608 ms 520 KB Output is correct
12 Correct 766 ms 452 KB Output is correct
13 Execution timed out 4053 ms 716 KB Time limit exceeded
14 Halted 0 ms 0 KB -