oj.uz

답안 #125089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125089 2019-07-04T15:07:33 Z arthurconmy 자리 배치 (IOI18_seats) C++14
11 / 100
 4000 ms 40216 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>

#include "seats.h"

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef pair<int,int> pii;
#define REP(i, a, b) for (int i = int(a); i <= int(b); i++)
#define REPb(j, d, c) for (int j = int(d); j >= int(c); j--)
#define ff first
#define ss second
#define pb push_back
#define len(x) int((x).size())

int h,w;
vi R,C;

void give_initial_chart(int H, int W, vi r, vi c)
{
	h=H;
	w=W;
	R=r;
	C=c;
}

int swap_seats(int a, int b)
{
	// R[i], C[i] are the coordinates of the ith person

  int oldra=R[a];
  int oldca=C[a];
  R[a]=R[b];
  C[a]=C[b];
  R[b]=oldra;
  C[b]=oldca;

  //cout<<"outchea"<<endl;

  int minr=R[0];
  int maxr=R[0];
  int minc=C[0];
  int maxc=C[0];

  int beauty=1;

  //cout << C[0] << " " << C[1] << " " << C[2] << endl;

  REP(i,1,h*w-1)
  {
    minr=min(minr,R[i]);
    maxr=max(maxr,R[i]);
    minc=min(minc,C[i]);
    maxc=max(maxc,C[i]);

    //cout << i << " " << maxr << " " << minr << " " << maxc << " " << minc << endl;

    if((maxr-minr+1)*(maxc-minc+1) == i+1) beauty++;
  }

  return beauty;
}

/*int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	ifstream cin("input.txt");
	//ifstream cin("test.in");
	//ofstream cout("test.out");

}*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 5 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 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 5 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 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 155 ms 816 KB Output is correct
14 Correct 156 ms 804 KB Output is correct
15 Correct 155 ms 812 KB Output is correct
16 Correct 156 ms 812 KB Output is correct
17 Correct 155 ms 888 KB Output is correct
18 Correct 156 ms 816 KB Output is correct
19 Correct 155 ms 760 KB Output is correct
20 Correct 155 ms 844 KB Output is correct
21 Correct 155 ms 808 KB Output is correct
22 Correct 155 ms 788 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4027 ms 39800 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 824 KB Output is correct
2 Correct 1382 ms 3752 KB Output is correct
3 Execution timed out 4019 ms 39800 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2036 KB Output is correct
2 Correct 23 ms 2008 KB Output is correct
3 Correct 37 ms 2036 KB Output is correct
4 Correct 171 ms 2076 KB Output is correct
5 Correct 1511 ms 2304 KB Output is correct
6 Execution timed out 4075 ms 40216 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 5 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 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 155 ms 816 KB Output is correct
14 Correct 156 ms 804 KB Output is correct
15 Correct 155 ms 812 KB Output is correct
16 Correct 156 ms 812 KB Output is correct
17 Correct 155 ms 888 KB Output is correct
18 Correct 156 ms 816 KB Output is correct
19 Correct 155 ms 760 KB Output is correct
20 Correct 155 ms 844 KB Output is correct
21 Correct 155 ms 808 KB Output is correct
22 Correct 155 ms 788 KB Output is correct
23 Execution timed out 4027 ms 39800 KB Time limit exceeded
24 Halted 0 ms 0 KB -