Submission #347634

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
347634	2021-01-13T09:40:01 Z	Markomafko972	Meteors (POI11_met)	C++14	74 / 100	1357 ms	65540 KB

#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);

int n, m, a, q;
vector<int> v[300005];
pair< pii, int > w[300005];
ll loga[300005];

void update(int x, int y) {
	x++;
	for (; x <= 300000; x += x & -x) loga[x] += y;
}

ll query(int x) {
	x++;
	ll out = 0;
	for (; x > 0; x -= x & -x) out += loga[x];
	return out;
}

vector< pair<pii, int> > gdje[300005];
vector< pair<pii, int> > slj[300005];
int sol[300005];
int treba[300005];

int main () {

	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		cin >> a;
		v[a-1].push_back(i);
	}
	
	for (int i = 0; i < n; i++) cin >> treba[i];
	
	cin >> q;
	for (int i = 0; i < q; i++) {
		cin >> w[i].X.X >> w[i].X.Y >> w[i].Y;
		w[i].X.X --;
		w[i].X.Y --;
	}
	
	/*for (int i = 0; i < q; i++) {
		if (w[i].X.X <= w[i].X.Y) {
			update(w[i].X.X, w[i].Y);
			update(w[i].X.Y+1, -w[i].Y);
		}
		else {
			update(w[i].X.X, w[i].Y);	
			update(0, w[i].Y);
			update(w[i].X.Y+1, -w[i].Y);
		}
	}*/
	
	int kol = n;
	for (int i = 0; i < n; i++) {
		gdje[(q-1)/2].push_back({{0, q-1}, i});
	}
	
	memset(sol, -1, sizeof sol);
	while (kol > 0) {
		for (int i = 0; i < q; i++) {
			if (w[i].X.X <= w[i].X.Y) {
				update(w[i].X.X, w[i].Y);
				update(w[i].X.Y+1, -w[i].Y);
			}
			else {
				update(w[i].X.X, w[i].Y);
				update(0, w[i].Y);
				update(w[i].X.Y+1, -w[i].Y);
			}
			
			/*cout << "QUERY" << endl;
			for (int j = 0; j < m; j++) cout << query(j) << " ";
			cout << endl; */
			
			for (int j = 0; j < gdje[i].size(); j++) {
				ll zbr = 0;
				for (int k = 0; k < v[gdje[i][j].Y].size(); k++) {
					//cout << "dodaj poziciju " << v[gdje[i][j].Y][k] << endl;
					zbr += query(v[gdje[i][j].Y][k]);
					if (zbr >= treba[gdje[i][j].Y]) break;
				}
				
				//cout << gdje[i][j].X.X << " do " << gdje[i][j].X.Y << ": " << gdje[i][j].Y << " " << zbr << endl;
				//system("pause");
				
				if (gdje[i][j].X.X == gdje[i][j].X.Y) {
					if (zbr >= treba[gdje[i][j].Y]) sol[gdje[i][j].Y] = i+1;
					else sol[gdje[i][j].Y] = -1;
					
					kol--;
				}
				else {
					if (zbr < treba[gdje[i][j].Y]) slj[(i+1+gdje[i][j].X.Y)/2].push_back({{i+1, gdje[i][j].X.Y}, gdje[i][j].Y});
					else {
						slj[(gdje[i][j].X.X+i)/2].push_back({{gdje[i][j].X.X, i}, gdje[i][j].Y});
					}
				}
			}
		}
		
		for (int i = 0; i < q; i++) {
			gdje[i] = slj[i];
			slj[i].clear();
		}
		
		memset(loga, 0, sizeof loga);
	}
	
	for (int i = 0; i < n; i++) {
		if (sol[i] == -1) cout << "NIE\n";
		else cout << sol[i] << "\n";
	}

	return 0;
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:86:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |    for (int j = 0; j < gdje[i].size(); j++) {
      |                    ~~^~~~~~~~~~~~~~~~
met.cpp:88:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int k = 0; k < v[gdje[i][j].Y].size(); k++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	25068 KB	Output is correct
2	Correct	20 ms	25196 KB	Output is correct
3	Correct	20 ms	25068 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	25068 KB	Output is correct
2	Correct	20 ms	25068 KB	Output is correct
3	Correct	20 ms	25324 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	133 ms	27884 KB	Output is correct
2	Correct	225 ms	35708 KB	Output is correct
3	Correct	196 ms	32304 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	201 ms	30512 KB	Output is correct
2	Correct	218 ms	30656 KB	Output is correct
3	Correct	249 ms	36032 KB	Output is correct
4	Correct	70 ms	30628 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	168 ms	28524 KB	Output is correct
2	Correct	265 ms	36768 KB	Output is correct
3	Correct	170 ms	25836 KB	Output is correct
4	Correct	218 ms	34024 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	176 ms	26220 KB	Output is correct
2	Correct	216 ms	30772 KB	Output is correct
3	Correct	154 ms	26988 KB	Output is correct
4	Correct	242 ms	37840 KB	Output is correct

Subtask #7
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1211 ms	65540 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1357 ms	65540 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
2	Halted	0 ms	0 KB	-