oj.uz

Submission #945995

# Submission time Handle Problem Language Result Execution time Memory
945995 2024-03-14T09:23:56 Z kokoxuya Fancy Fence (CEOI20_fancyfence) C++14
12 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define moddy 1000000007

int findRect(int height, int width, int inc)
{
	//cout << height << " " << width << " " << inc << " ";
	int ans = (height + 1) * height / 2;
	ans *= width;
	ans *= inc;
	//cout << ans << "\n";
	return ans;
}

int incRect(int height, int width)
{
	//cout << height << " " << width << " ";
	int ans = height * (height + 1)/2;
	ans *= ((width + 1) * width/2);
	//cout << ans << "\n";
	return ans;
}

signed main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int N;
	cin >> N;
	vector<int>heights(N + 20);
	vector<int>widths(N + 20);
	
	for (int a = 1; a <= N; a++)
	{
		cin >> heights[a];
	}
	for (int a = 1; a <= N; a++)
	{
		cin >> widths[a];
	}
	
	int ans = 0;
	queue<pair<int,int>>prevvy; //height, width
	for (int curr = 1; curr <= N; curr++)
	{
		//cout << "at rectangle " << curr << ":\n";
		int at = 0,prevwidth = 0;
		queue<pair<int,int>>curry;
		while (!prevvy.empty())
		{
			if (at == heights[curr])
			{
				break;
			}
			ans += (findRect(min(heights[curr], prevvy.front().first), prevvy.front().second, widths[curr]));
			ans -= (findRect(at,prevvy.front().second,widths[curr]));
			ans %= moddy;
			curry.push({min(heights[curr], prevvy.front().first), prevvy.front().second + widths[curr]});
			at = min(heights[curr], prevvy.front().first);
			//cout << "\n";
			prevvy.pop();
		}
		ans += incRect(heights[curr],widths[curr]);
		ans %= moddy;
		if (at != heights[curr])
		{
			curry.push({heights[curr],widths[curr]});
		}
		prevvy = curry;
	}
	
	ans %= moddy;
	cout << ans;
	//cout << " at end ";
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:47:14: warning: unused variable 'prevwidth' [-Wunused-variable]
   47 |   int at = 0,prevwidth = 0;
      |              ^~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -