oj.uz

Submission #125224

# Submission time Handle Problem Language Result Execution time Memory
125224 2019-07-04T21:12:03 Z chubyxdxd Seats (IOI18_seats) C++11
11 / 100
 4000 ms 41372 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);
  }
  /*for(int i=0;i<H*W;i++){
  	cout<<vmaxx[i]<<" "<<vminx[i]<<" "<<vmaxy[i]<<" "<<vminy[i]<<endl;
  }*/
  //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[0],minx=r[0],maxy=c[0],miny=c[0];
  	int tam=vmaxx.size();
  	for(int i=0;i<tam;i++){
  		maxx=max(r[i],maxx);
  		minx=min(r[i],minx);
  		maxy=max(c[i],maxy);
  		miny=min(c[i],miny);
  		vmaxx[i]=maxx;
  		vmaxy[i]=maxy;
  		vminx[i]=minx;
  		vminy[i]=miny;	
  	}
  	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++;
  		}
  	}
  	return g;
  }
}

Compilation message

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:41:7: warning: unused variable 'x1' [-Wunused-variable]
   int x1,y1;
       ^~
seats.cpp:41:10: warning: unused variable 'y1' [-Wunused-variable]
   int x1,y1;
          ^~
seats.cpp:77:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 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 7 ms 456 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 6 ms 504 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 504 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 504 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 7 ms 456 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 6 ms 504 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 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 271 ms 1136 KB Output is correct
14 Correct 271 ms 1136 KB Output is correct
15 Correct 274 ms 1144 KB Output is correct
16 Correct 275 ms 1144 KB Output is correct
17 Correct 317 ms 1144 KB Output is correct
18 Correct 269 ms 1144 KB Output is correct
19 Correct 275 ms 1144 KB Output is correct
20 Correct 274 ms 1144 KB Output is correct
21 Correct 276 ms 1140 KB Output is correct
22 Correct 272 ms 1136 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 798 ms 40224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 1148 KB Output is correct
2 Correct 1756 ms 4576 KB Output is correct
3 Execution timed out 4049 ms 40672 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2036 KB Output is correct
2 Correct 25 ms 2036 KB Output is correct
3 Correct 44 ms 2036 KB Output is correct
4 Correct 228 ms 2036 KB Output is correct
5 Correct 2726 ms 2676 KB Output is correct
6 Execution timed out 4050 ms 41372 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 504 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 7 ms 456 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 6 ms 504 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 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 271 ms 1136 KB Output is correct
14 Correct 271 ms 1136 KB Output is correct
15 Correct 274 ms 1144 KB Output is correct
16 Correct 275 ms 1144 KB Output is correct
17 Correct 317 ms 1144 KB Output is correct
18 Correct 269 ms 1144 KB Output is correct
19 Correct 275 ms 1144 KB Output is correct
20 Correct 274 ms 1144 KB Output is correct
21 Correct 276 ms 1140 KB Output is correct
22 Correct 272 ms 1136 KB Output is correct
23 Incorrect 798 ms 40224 KB Output isn't correct
24 Halted 0 ms 0 KB -