oj.uz

Submission #496341

# Submission time Handle Problem Language Result Execution time Memory
496341 2021-12-21T06:07:25 Z Nuraly_Serikbay Meteors (POI11_met) C++14
0 / 100
 2 ms 460 KB 
#include <bits/stdc++.h>
  
#define endl "\n"
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz size()
#define rep(i,k,n) for(int i = k ; i <= n ; ++i)
#define per(i,k,n) for(int i = k ; i >= n ; --i)
#define Zymraq() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define fr(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define toqta return 0
#define PERMUTE next_permutation
#define no cout<<"No"<<endl;
#define yes cout<<"Yes"<<endl;
#define a() a + 1, a + n + 1  
 
  
using namespace std;
   
typedef long long ll;
typedef unsigned long long ull;
typedef string S;
typedef double ld;
typedef long double lld;
   
const int N = 1e6 + 17;
const int modd = 1e9 + 7;
const int INF = 1e9 - 19;
const int P = 37;
const ll NN = 1e7 + 17;
const ld eps = 1e-19;
const double pi = 3.141592653589793238462643383279 ;
   
 
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){
    return (a.second < b.second);
}
 
void pre (ll a) {
    cout << fixed << setprecision(a);
    return;
}

ll n, m;
ll a[2000], indeed[2000];
ll col[2000], cnt[2000];

inline void Solution () {
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; ++ i) {
		ll x;
		cin >> x;
		indeed[i] = x;
	}
	ll q;
	cin >> q;
	while (q --) {
		ll l, r, ves;
		cin >> l >> r >> ves;
		if (l > r) {
			for (int i = l; i <= m; ++ i) {
				if (indeed[a[i]] > 0) {
					indeed[a[i]] -= ves;
					col[a[i]] = 1;
				}	
			}
			for (int i = 1; i <= r; ++ i) {
				if (indeed[a[i]] > 0) {
					indeed[a[i]] -= ves;
					col[a[i]] = 1;
				}
			}
			for (int i = 1; i <= n; ++ i) {
				if (col[i] == 1) cnt[i] ++;	
				col[i] = 0;
			}
		} else {
			for (int i = l; i <= r; ++ i) {
				if (indeed[a[i]] > 0) {
					indeed[a[i]] -= ves;
					col[a[i]] = 1;
				}
			}
			for (int i = 1; i <= n; ++ i) {
				if (col[i]) cnt[i] ++;
				col[i] = 0;
			}
		}
	}
	for (int i = 1; i <= n; ++ i) {
		if (indeed[i] > 0) {
			cout << "NIE\n";
			continue;
		}
		cout << cnt[i] << '\n';
	}
	return;
}    


int main () {
	Zymraq();
	Solution ();
	exit (0);
}/*

*/

Subtask #1
0 / 12.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

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

Subtask #6
0 / 13.0

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

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -