Submission #45042

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
45042	2018-04-11T05:06:21 Z	Xellos	Baza (COCI17_baza)	C++14	50 / 50	141 ms	30248 KB

baza

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N,M;
	cin >> N >> M;
	vector< vector<int> > A(N,vector<int>(M));
	for(int i =0; i < N; i++) for(int j =0; j < M; j++) cin >> A[i][j];
	int Q;
	cin >> Q;
	for(int q =0; q < Q; q++) {
		vector<int> is(N,1);
		for(int i =0; i < M; i++) {
			int a;
			cin >> a;
			if(a == -1) continue;
			for(int j =0; j < N; j++) if(A[j][i] != a) is[j] =0;}
		int ans =0;
		for(int i =0; i < N; i++) ans +=is[i];
		cout << ans << "\n";}
	}

// look at my code
// my code is amazing

Subtask #1

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	57 ms	2680 KB	Output is correct
2	Correct	20 ms	3452 KB	Output is correct
3	Correct	85 ms	7956 KB	Output is correct
4	Correct	19 ms	7956 KB	Output is correct
5	Correct	57 ms	10708 KB	Output is correct
6	Correct	85 ms	14932 KB	Output is correct
7	Correct	141 ms	20460 KB	Output is correct
8	Correct	72 ms	22676 KB	Output is correct
9	Correct	43 ms	23784 KB	Output is correct
10	Correct	106 ms	30248 KB	Output is correct