oj.uz

답안 #63392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
63392 2018-08-01T16:28:49 Z bazsi700 전차 (CEOI13_tram) C++14
0 / 100
 1000 ms 4156 KB 
#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007
#define ll long long int
#define vi vector<int>
#define vii vector< vector<int> >
#define PI 3.1415926535897932384626433832795
#define INF 9223372036854775807LL

double dist[150002][3];
bool occ[150002][3];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	int n,m;
	cin >> n >> m;
	map<int,pair<int,int> > pass;
	pair<int,int> mnat = {1,1};
	for(int ev = 1; ev <= m; ev++) {
		char ch;
		cin >> ch;
		if(ch == 'E') {
			mnat = {1,1};
			//cout << setprecision(7);
			for(int i = 1; i <= n; i++) {
				for(int c = 1; c <= 2; c++) {
				//	cout << dist[i][c] << " ";
					if(dist[i][c] > dist[mnat.first][mnat.second]+0.000001) {
						mnat = {i,c};
					}
				}
				//cout << endl;
			}
			pass[ev] = mnat;
			cout << mnat.first << " " << mnat.second << "\n";
			occ[mnat.first][mnat.second] = true;
			for(int c = 1; c <= 2; c++) {
				int lastwasat = mnat.first;
				for(int i = mnat.first; i <= n; i++) {
					double dis = sqrt((i-lastwasat)*(i-lastwasat)+(c-mnat.second)*(c-mnat.second));
					if(dist[i][c] < dis+1.5) {
						break;
					}
					dist[i][c] = min(dist[i][c],dis);
				}
				for(int i = mnat.first; i >= 1; i--) {
					double dis = sqrt((i-lastwasat)*(i-lastwasat)+(c-mnat.second)*(c-mnat.second));
					if(dist[i][c] < dis+1.5) {
						break;
					}
					dist[i][c] = min(dist[i][c],dis);
				}
			}
		} else {
			int x;
			cin >> x;
			auto pr = pass[x];
			occ[pr.first][pr.second] = false;
			pass.erase(x);
			for(int i = 1; i <= n; i++) {
				dist[i][1] = dist[i][2] = 3000000;
			}
			for(int c = 1; c <= 2; c++) {
				int lastwasat = -1;
				for(int i = 1; i <= n; i++) {
					if(occ[i][c]) {
						lastwasat = i;
					}
					if(lastwasat != -1) {
						dist[i][c] = min(dist[i][c],double(i-lastwasat));
					}
				}
				lastwasat = -1;
				for(int i = n; i >= 1; i--) {
					if(occ[i][c]) {
						lastwasat = i;
					}
					if(lastwasat != -1) {
						dist[i][c] = min(dist[i][c],double(lastwasat-i));
					}
				}
			}
			for(int c = 1; c <= 2; c++) {
				int lastwasat = -1;
				for(int i = 1; i <= n; i++) {
					if(occ[i][3-c]) {
						lastwasat = i;
					}
					if(lastwasat != -1) {
						dist[i][c] = min(dist[i][c],sqrt((i-lastwasat)*(i-lastwasat)+1));
					}
				}
				lastwasat = -1;
				for(int i = n; i >= 1; i--) {
					if(occ[i][3-c]) {
						lastwasat = i;
					}
					if(lastwasat != -1) {
						dist[i][c] = min(dist[i][c],sqrt((i-lastwasat)*(i-lastwasat)+1));
					}
				}
			}
		}
		//cout << endl;
		//cout << endl;
	}
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 15.0

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

Subtask #8
0 / 20.0

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