oj.uz

답안 #144159

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144159 2019-08-16T08:24:56 Z arayi Segway (COI19_segway) C++17
100 / 100
 693 ms 24500 KB 
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;

lli gcd(lli a, lli b) {
	if (b == 0)
		return a;
	return gcd(b, a % b);
}
lli cg(lli n) {
	return n ^ (n >> 1);
}
lli SUM(lli a)
{
	return (a * (a + 1) / 2);
}
bool CAN(int x, int y, int n, int m)
{
	if (x >= 0 && y >= 0 && x < n && y < m)
	{
		return true;
	}
	return false;
}
double her(double x1, double y1, double x2, double y2)
{
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b)
{
	int p = 0;
	string c;
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	if (b.length() < a.length())
	{
		for (int i = b.length(); i < a.length(); i++)
		{
			b += "0";
		}
	}
	else
	{
		for (int i = a.length(); i < b.length(); i++)
		{
			a += "0";
		}
	}

	a += "0", b += "0";
	for (int i = 0; i < a.length(); i++)
	{
		c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
		p = (a[i] + b[i] - '0' - '0' + p) / 10;
	}
	if (c[c.length() - 1] == '0') c.erase(c.length() - 1, 1);
	reverse(c.begin(), c.end());
	return c;
}
string strmin(string a, string b)
{
	if (a.length() > b.length()) return b;
	if (b.length() > a.length()) return a;
	for (int i = 0; i < a.length(); i++)
	{
		if (a[i] > b[i]) return b;
		if (b[i] > a[i]) return a;
	}
	return a;
}

char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };



const int N = 1e6 + 30;
const lli mod = 998244353;

int n, m, x[20010];
int a[20010][3], b[301], sm[20010];
int s[301][20010];
int k[20010];
int main()
{
	fastio;
	//freopen("c.in", "r", stdin);
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i][0] >> a[i][1] >> a[i][2];
	}
	cin >> m;
	for (int j = 1; j <= m; j++)
	{
		
		cin >> b[j];
		for (int i = 0; i < n; i++)
		{
			if (sm[i] > b[j])
			{
				s[j][i] = s[j - 1][i] - sm[i] + b[j];
			}
			else
			{
				s[j][i] = s[j - 1][i] + 
					max(0, (min(100, b[j]) - sm[i])) * a[i][0] + 
					max(0, (min(200, b[j]) - max(100, sm[i]))) * a[i][1] + 
					max(0, b[j] - max(200, sm[i])) * a[i][2];
			}
			k[i] = s[j][i];
		}
		sort(k, k + n);
		for (int i = 0; i < n; i++)
		{
			x[i] = lower_bound(k, k + n, s[j][i]) - k;
		}
		//cout << endl;
		for (int i = 0; i < n; i++)
		{
			//cout << x[i] << " ";
			if (sm[i] > b[j])
			{
				s[j][i] = s[j - 1][i];
				continue;
			}
			sm[i] = b[j] + (x[i] % 20);
			s[j][i] += (x[i] % 20);
			//cout << s[j][i] << endl;
		}
	}
	for (int i = 0; i < n; i++)
	{
		//cout << s[m][i] << " ";
		if (sm[i] > 300)
			s[m][i] -= sm[i] - 300;
		else
		{
			s[m][i] += max(0, 100 - sm[i]) * a[i][0] +
				max(0, 200 - max(100, sm[i])) * a[i][1] +
				max(0, 300 - max(200, sm[i])) * a[i][2];
		}
		cout << s[m][i] << endl;
	}
	return 0;
}

Compilation message

segway.cpp: In function 'std::__cxx11::string strsum(std::__cxx11::string, std::__cxx11::string)':
segway.cpp:57:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = b.length(); i < a.length(); i++)
                            ~~^~~~~~~~~~~~
segway.cpp:64:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = a.length(); i < b.length(); i++)
                            ~~^~~~~~~~~~~~
segway.cpp:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.length(); i++)
                  ~~^~~~~~~~~~~~
segway.cpp: In function 'std::__cxx11::string strmin(std::__cxx11::string, std::__cxx11::string)':
segway.cpp:84:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.length(); i++)
                  ~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 11 ms 504 KB Output is correct
5 Correct 62 ms 1172 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 3 ms 1656 KB Output is correct
5 Correct 4 ms 376 KB Output is correct
6 Correct 4 ms 1528 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 12 ms 1656 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 11 ms 504 KB Output is correct
5 Correct 62 ms 1172 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 1144 KB Output is correct
9 Correct 3 ms 1656 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 5 ms 760 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 12 ms 1656 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 69 ms 3576 KB Output is correct
19 Correct 136 ms 4088 KB Output is correct
20 Correct 51 ms 1312 KB Output is correct
21 Correct 264 ms 7060 KB Output is correct
22 Correct 600 ms 15928 KB Output is correct
23 Correct 693 ms 24500 KB Output is correct