oj.uz

Submission #125172

# Submission time Handle Problem Language Result Execution time Memory
125172 2019-07-04T20:06:51 Z chubyxdxd Seats (IOI18_seats) C++11
11 / 100
 4000 ms 53280 KB 
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
std::vector<int> r;
std::vector<int> c;
typedef pair<int,int> ii;
vector<int> vmaxx;
vector<int> vmaxy;
vector<int> vminy;
vector<int> vminx;
int  g=0,e,d;
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
  r = R;
  c = C;
  int maxx=r[0],minx=r[0],maxy=c[0],miny=c[0]; 
  for(int i=0;i<H*W;i++){
  	int x1,y1;
  	x1=r[i];
  	y1=c[i];
  	maxx=max(maxx,x1);
  	minx=min(minx,x1);
  	maxy=max(maxy,y1);
  	miny=min(miny,y1);
  	d=abs(maxx-minx)+1;
  	e=abs(maxy-miny)+1;
  	if(d*e==i+1){
  		g++;
  	}
  	vmaxx.pb(maxx);
  	vmaxy.pb(maxy);
  	vminx.pb(minx);
  	vminy.pb(miny);
  }
  //cout<<g<<endl;
}
int swap_seats(int a, int b) {
  int x1,y1;
  //int x2,y2;
  swap(r[a],r[b]);
  swap(c[a],c[b]);
  int maxx=r[0],minx=r[0],maxy=c[0],miny=c[0];
  /*if(abs(a-b)<=10000){
  	int j=min(a,b);
  	int k=max(a,b);
  	for(int i=j;i<=k;i++){
  		d=abs(vmaxx[i]-vminx[i])+1;
  		e=abs(vmaxy[i]-vminy[i])+1;
  		if(e*d==i+1){
  			g--;
  		}
  	}
  	int maxx=r[j],minx=r[j],maxy=c[j],miny=c[j];
  	for(int i=j;i<=k;i++){
  		x1=r[i];
  		y1=c[i];
  		maxx=max(maxx,x1);
  		minx=min(minx,x1);
  		maxy=max(maxy,y1);
  		miny=min(miny,y1);
  		vmaxx[i]=maxx;
  		vmaxy[i]=maxy;
  		vminx[i]=minx;
  		vminy[i]=miny;
  		d=abs(vmaxx[i]-vminx[i])+1;
  		e=abs(vmaxy[i]-vminy[i])+1;
  		if(e*d==i+1){
  			g++;
  		}
  	}  	
  	return g;
  }*/
  int tam=r.size();
  g=0;
  for(int i=0;i<tam;i++){
  	x1=r[i];
  	y1=c[i];
  	maxx=max(maxx,x1);
  	minx=min(minx,x1);
  	maxy=max(maxy,y1);
  	miny=min(miny,y1);
  	d=abs(maxx-minx)+1;
  	e=abs(maxy-miny)+1;
  	if(e*d==i+1){
  		g++;
  	}
  	//cout<<d*e<<" "<<g<<endl;	
  }
  return g;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 6 ms 632 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 564 KB Output is correct
12 Correct 6 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 6 ms 632 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 564 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 194 ms 1144 KB Output is correct
14 Correct 195 ms 1132 KB Output is correct
15 Correct 194 ms 1132 KB Output is correct
16 Correct 192 ms 1128 KB Output is correct
17 Correct 195 ms 1140 KB Output is correct
18 Correct 191 ms 1140 KB Output is correct
19 Correct 199 ms 1144 KB Output is correct
20 Correct 195 ms 1136 KB Output is correct
21 Correct 196 ms 1272 KB Output is correct
22 Correct 198 ms 1144 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4022 ms 39584 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 888 KB Output is correct
2 Correct 1753 ms 5300 KB Output is correct
3 Execution timed out 4019 ms 52768 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1396 KB Output is correct
2 Correct 23 ms 2036 KB Output is correct
3 Correct 42 ms 2008 KB Output is correct
4 Correct 223 ms 2064 KB Output is correct
5 Correct 1907 ms 2908 KB Output is correct
6 Execution timed out 4030 ms 53280 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 6 ms 632 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 ms 564 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 194 ms 1144 KB Output is correct
14 Correct 195 ms 1132 KB Output is correct
15 Correct 194 ms 1132 KB Output is correct
16 Correct 192 ms 1128 KB Output is correct
17 Correct 195 ms 1140 KB Output is correct
18 Correct 191 ms 1140 KB Output is correct
19 Correct 199 ms 1144 KB Output is correct
20 Correct 195 ms 1136 KB Output is correct
21 Correct 196 ms 1272 KB Output is correct
22 Correct 198 ms 1144 KB Output is correct
23 Execution timed out 4022 ms 39584 KB Time limit exceeded
24 Halted 0 ms 0 KB -