oj.uz

답안 #220648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
220648 2020-04-08T10:52:20 Z _7_7_ 청소 (JOI20_sweeping) C++14
1 / 100
 476 ms 32992 KB 
#include <bits/stdc++.h>                                           
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e6 + 5e5 + 111;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


int n, m, q, x[N], y[N], tp[N], a[N], b[N], z[N];

bool CHECK () {
	for (int i = 1; i <= q; ++i)
		if (tp[i] == 3)
			return 0;

	return 1;
}

struct ST {
	int tl, tr, mx;
	ST *l, *r;
	ST () {
		tl = tr = -1;
		l = r = NULL;
		mx = -inf;
	}

	ST (int a, int b) {
		tl = a, tr = b;
		l = r = NULL;
		mx = -inf;
	}

	void update (int pos, int x) {
		if (tl == tr) {
			mx = max(mx, x);
			return;
		}
			
		int tm = (tl + tr)  >> 1;
		if (pos <= tm) {
		    if (!l)
		    	l = new ST(tl, tm);
			l->update(pos, x); 
		} else {
			if (!r)
				r = new ST(tm + 1, tr);
			r->update(pos, x);
		}		
		mx = max(!l ? -inf : l->mx, !r ? -inf : r->mx);
	}

	int get (int lf, int rg) {
		if (lf > rg || tl > rg || lf > tr)
			return -inf;
		if (lf <= tl && tr <= rg)
			return mx;
		return max(r->get(lf, rg), l->get(lf, rg));
	}
};

struct BIT {
	ST *T[N];
	
	void upd (int x, int y, int z) {
		x = N - 1 - x;	
		while (x < N) {
			if (!T[x])
				T[x] = new ST(0, inf);
			T[x]->update(y, z);
			x |= x + 1;
		}
	}

	int Get (int x, int y) {
		int res = 0;
		x = N - 1 - x;
		while (x >= 0) {
			if (T[x])
				res = max(res, T[x]->get(y, inf));
			x = (x & (x + 1)) - 1;
		}
		return res;
	}
} B;



main () {
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= m; ++i)
		scanf("%d%d", &x[i], &y[i]);
	for (int i = 1; i <= q; ++i) {
		scanf("%d%d", &tp[i], &a[i]);
		if (tp[i] == 4) 
			scanf("%d", &b[i]);		
	}

	if (m <= 2000 && q <= 5000) {
		for (int i = 1; i <= q; ++i) {
			if (tp[i] == 1)
				printf("%d %d\n", x[a[i]], y[a[i]]);
			else if (tp[i] == 3) {
				for (int j = 1; j <= m; ++j)
					if (x[j] <= a[i])
						y[j] = max(y[j], n - a[i]);
			} else if (tp[i] == 2) {
				for (int j = 1; j <= m; ++j)
					if (y[j] <= a[i])
						x[j] = max(x[j], n - a[i]);
			} else {
				x[++m] = a[i];
				y[m] = b[i];
			}
		}
		return 0;
	}


	if (CHECK()) {
		for (int i = 1; i <= q; ++i) {
			if (tp[i] == 1)
				printf("%d %d\n", max(x[a[i]], B.Get(z[a[i]], y[a[i]])), y[a[i]]);
			else if (tp[i] == 2) 
				B.upd(i, a[i], n - a[i]);
			else {
				x[++m] = a[i];
				y[m] = b[i];
				z[m] = i;
			} 
			cerr << i << endl;
		}
		return 0;
	}
}

Compilation message

sweeping.cpp: In member function 'void ST::update(int, int)':
sweeping.cpp:72:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
       if (!l)
       ^~
sweeping.cpp:74:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    l->update(pos, x); 
    ^
sweeping.cpp: At global scope:
sweeping.cpp:119:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
sweeping.cpp: In function 'int main()':
sweeping.cpp:120:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &m, &q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:122:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x[i], &y[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:124:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &tp[i], &a[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:126:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &b[i]);  
    ~~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 640 KB Output is correct
2 Correct 9 ms 512 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 14 ms 640 KB Output is correct
5 Correct 32 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 476 ms 32992 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

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

Subtask #4
0 / 53.0

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

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 640 KB Output is correct
2 Correct 9 ms 512 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 14 ms 640 KB Output is correct
5 Correct 32 ms 512 KB Output is correct
6 Correct 10 ms 512 KB Output is correct
7 Runtime error 476 ms 32992 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -