oj.uz

Submission #841860

# Submission time Handle Problem Language Result Execution time Memory
841860 2023-09-02T07:43:44 Z TheLostCookie Soccer Stadium (IOI23_soccer) C++17
0 / 100
 4500 ms 80876 KB 
#include "soccer.h"
#include <algorithm>
#include <set>
#include <tuple>

struct DCSet {
	int n;
	std::vector<std::multiset<std::tuple<int,int,int,int>>> s;
	
	DCSet(int n): n(n), s(4*n) {
		
	}
	
	void insert(const std::tuple<int,int,int,int> &e) {
		insert(e,0,0,n-1);
	}
	
	void erase(const std::tuple<int,int,int,int> &e) {
		erase(e,0,0,n-1);
	}
	
	std::vector<std::tuple<int,int,int,int>> get(int p) {
		std::vector<std::tuple<int,int,int,int>> ret;
		int u=0,l=0,r=n-1;
		while(r-l) {
			for(auto e: s[u]) ret.push_back(e);
			int m = (l+r+1)/2;
			if(p<=m-1) u=2*u+1,r=m-1;
			else u=2*u+2,l=m;
		}
		for(auto e: s[u]) ret.push_back(e);
		
		return ret;
	}
	
private:
	void insert(const std::tuple<int,int,int,int> &e, int u, int l, int r) {
		auto [l0,r0,i,j] = e;
		if(l0 <= l && r <= r0) {
			s[u].insert(e);
		} else if(r-l>=1) {
			int m = (l+r+1)/2;
			if(l0 <= m-1) insert(e,2*u+1,l,m-1);
			if(m <= r0) insert(e,2*u+2,m,r);
		}
	}
	void erase(const std::tuple<int,int,int,int> &e, int u, int l, int r) {
		auto [l0,r0,i,j] = e;
		if(l0 <= l && r <= r0) {
			s[u].erase(s[u].find(e));
		} else if(r-l>=1) {
			int m = (l+r+1)/2;
			if(l0 <= m-1) erase(e,2*u+1,l,m-1);
			if(m <= r0) erase(e,2*u+2,m,r);
		}
	}
};

int biggest_stadium(int N, std::vector<std::vector<int>> F) {
	auto solveDirection = [&N](std::vector<std::vector<int>> g)->std::vector<std::vector<int>> {		
		std::vector<std::vector<int>> d(N+1,std::vector<int>(N+1,0));
		DCSet s(N);
		
		auto split = [&d,&s](int row, int p) {
			auto pIntervals = s.get(p);
			for(auto e: pIntervals) {
				auto [l,r,i,j] = e;
				d[i][l] += (r-l+1)*(row-j);
				d[i][r+1] -= (r-l+1)*(row-j);
				s.erase(e);
				if(l<p) {
					s.insert(std::make_tuple(l,p-1,i,row));
				}
				if(p<r) {
					s.insert(std::make_tuple(p+1,r,i,row));
				}
			}
			return;
		};
		
		for(int i = 0; i < N; i++) {
			//Insert new elements;
			/*for(int l=0,r; l<N; l=r+1) {
				if(!g[i][l]) {
					r=l;
					while(r<N-1&&!g[i][r+1]) r++;
					s.insert(std::make_tuple(l,r,i,i));
				} else r=l;
			}*/
			s.insert(std::make_tuple(0,N-1,i,i));
			
			//Split intervals
			for(int j = 0; j < N; j++) {
				if(g[i][j]) split(i,j);
			}			
		}
		
		//Handle remaining elements
		for(int j = 0; j < N; j++) {
			split(N,j);
		}
		
		for(int i = 0; i < N; i++) {
			for(int j = 0; j < N; j++) {
				d[i][j+1] += d[i][j];
			}
			d[i].pop_back();
		}
		d.pop_back();
	
		return d;
	};
	
	auto down = solveDirection(F);
	std::reverse(F.begin(),F.end());
	auto up = solveDirection(F);
	std::reverse(F.begin(),F.end());
	std::reverse(up.begin(),up.end());
	
	int ans = 0;
	for(int i = 0; i < N; i++) {
		std::vector<int> prv(N);
		std::vector<int> nxt(N);
		for(int j = 0; j < N; j++) {
			prv[j] = (F[i][j]?j:(j==0?-1:prv[j-1]));
		}
		for(int j = N-1; j >= 0; j--) {
			nxt[j] = (F[i][j]?j:(j==N-1?N:nxt[j+1]));
		}
		for(int j = 0; j < N; j++) {
			if(!F[i][j]) ans = std::max(ans,down[i][j]+up[i][j]-(nxt[j]-prv[j]-1));
		}
	}
	
	return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok

Subtask #1
0.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 12 ms 600 KB ok
8 Correct 323 ms 5660 KB ok
9 Execution timed out 4510 ms 80876 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ok
2 Correct 0 ms 344 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 600 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Incorrect 1 ms 344 KB wrong
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 600 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 0 ms 344 KB ok
8 Incorrect 1 ms 344 KB wrong
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 0 ms 600 KB ok
8 Correct 0 ms 344 KB ok
9 Correct 0 ms 344 KB ok
10 Incorrect 1 ms 344 KB wrong
11 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 0 ms 600 KB ok
8 Correct 0 ms 344 KB ok
9 Correct 0 ms 344 KB ok
10 Incorrect 1 ms 344 KB wrong
11 Halted 0 ms 0 KB -

Subtask #6
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB ok
2 Correct 0 ms 348 KB ok
3 Correct 0 ms 344 KB ok
4 Correct 0 ms 344 KB ok
5 Correct 0 ms 344 KB ok
6 Correct 0 ms 344 KB ok
7 Correct 0 ms 344 KB ok
8 Correct 12 ms 600 KB ok
9 Correct 323 ms 5660 KB ok
10 Execution timed out 4510 ms 80876 KB Time limit exceeded
11 Halted 0 ms 0 KB -