oj.uz

Submission #279053

# Submission time Handle Problem Language Result Execution time Memory
279053 2020-08-22T04:24:51 Z khangal Seats (IOI18_seats) C++14
11 / 100
 4000 ms 57300 KB 
#include<bits/stdc++.h>
#include "seats.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    n=H;
    m=W;
    rep(i,0,n*m-1){
        c[i]=R[i];
        d[i]=C[i];
        c1[c[i]][d[i]]=i;
    }
}
int swap_seats(int a, int b) {
    swap(c[a],c[b]);
    swap(d[a],d[b]);
    swap(c1[c[a]][d[a]],c1[c[b]][d[b]]);
    int maxx=0, minx=MAX, maxy=0, miny=MAX;
    int ans=0;
    for(int i=0;i<n*m;i++){
        x = c[i];
        y = d[i];
        minx = min(minx,c[i]);
        maxx = max(maxx,c[i]);
        miny = min(miny,d[i]);
        maxy = max(maxy,d[i]);
        if((maxx-minx+1)*(maxy-miny+1)==i+1) ans++;
    }
    return ans;
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:23:13: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   23 | #define MAX 1e18
      |             ^~~~
seats.cpp:56:22: note: in expansion of macro 'MAX'
   56 |     int maxx=0, minx=MAX, maxy=0, miny=MAX;
      |                      ^~~
seats.cpp:23:13: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   23 | #define MAX 1e18
      |             ^~~~
seats.cpp:56:40: note: in expansion of macro 'MAX'
   56 |     int maxx=0, minx=MAX, maxy=0, miny=MAX;
      |                                        ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29440 KB Output is correct
2 Correct 30 ms 29440 KB Output is correct
3 Correct 25 ms 29440 KB Output is correct
4 Correct 27 ms 29440 KB Output is correct
5 Correct 27 ms 29452 KB Output is correct
6 Correct 26 ms 29440 KB Output is correct
7 Correct 29 ms 29440 KB Output is correct
8 Correct 27 ms 29444 KB Output is correct
9 Correct 31 ms 29440 KB Output is correct
10 Correct 25 ms 29440 KB Output is correct
11 Correct 30 ms 29440 KB Output is correct
12 Correct 25 ms 29440 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29440 KB Output is correct
2 Correct 30 ms 29440 KB Output is correct
3 Correct 25 ms 29440 KB Output is correct
4 Correct 27 ms 29440 KB Output is correct
5 Correct 27 ms 29452 KB Output is correct
6 Correct 26 ms 29440 KB Output is correct
7 Correct 29 ms 29440 KB Output is correct
8 Correct 27 ms 29444 KB Output is correct
9 Correct 31 ms 29440 KB Output is correct
10 Correct 25 ms 29440 KB Output is correct
11 Correct 30 ms 29440 KB Output is correct
12 Correct 25 ms 29440 KB Output is correct
13 Correct 186 ms 29708 KB Output is correct
14 Correct 212 ms 29696 KB Output is correct
15 Correct 203 ms 29716 KB Output is correct
16 Correct 232 ms 34424 KB Output is correct
17 Correct 187 ms 29688 KB Output is correct
18 Correct 187 ms 29852 KB Output is correct
19 Correct 211 ms 30328 KB Output is correct
20 Correct 191 ms 32256 KB Output is correct
21 Correct 194 ms 29824 KB Output is correct
22 Correct 261 ms 34656 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 29696 KB Output is correct
2 Correct 1495 ms 31608 KB Output is correct
3 Execution timed out 4051 ms 53368 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 30452 KB Output is correct
2 Correct 46 ms 30404 KB Output is correct
3 Correct 61 ms 30452 KB Output is correct
4 Correct 201 ms 30428 KB Output is correct
5 Correct 1610 ms 30960 KB Output is correct
6 Execution timed out 4065 ms 57300 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 29440 KB Output is correct
2 Correct 30 ms 29440 KB Output is correct
3 Correct 25 ms 29440 KB Output is correct
4 Correct 27 ms 29440 KB Output is correct
5 Correct 27 ms 29452 KB Output is correct
6 Correct 26 ms 29440 KB Output is correct
7 Correct 29 ms 29440 KB Output is correct
8 Correct 27 ms 29444 KB Output is correct
9 Correct 31 ms 29440 KB Output is correct
10 Correct 25 ms 29440 KB Output is correct
11 Correct 30 ms 29440 KB Output is correct
12 Correct 25 ms 29440 KB Output is correct
13 Correct 186 ms 29708 KB Output is correct
14 Correct 212 ms 29696 KB Output is correct
15 Correct 203 ms 29716 KB Output is correct
16 Correct 232 ms 34424 KB Output is correct
17 Correct 187 ms 29688 KB Output is correct
18 Correct 187 ms 29852 KB Output is correct
19 Correct 211 ms 30328 KB Output is correct
20 Correct 191 ms 32256 KB Output is correct
21 Correct 194 ms 29824 KB Output is correct
22 Correct 261 ms 34656 KB Output is correct
23 Execution timed out 4025 ms 53336 KB Time limit exceeded
24 Halted 0 ms 0 KB -