oj.uz

Submission #969929

# Submission time Handle Problem Language Result Execution time Memory
969929 2024-04-25T21:14:32 Z shadow_sami Spring cleaning (CEOI20_cleaning) C++17
0 / 100
 1000 ms 1648 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
#define ff first
#define ss second
#define fip(a,b) for(ll i = a ; i<b;i++)
#define fjp(a,b) for(ll j = a ; j<b;j++)
#define fp(k,a,b) for(ll k = a ; k<b;k++)
#define fin(a,b) for(ll i = a;i>=b;i--)
#define fjn(a,b) for(ll j = a;j>=b;j--)
#define fn(k,a,b) for(ll k = a;k>=b;k--)
#define fx(k) for(auto x : k)
#define ordered_set <ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define totalone(x) _builtin_popcountll(x)
#define frontzero(x) _builtin_clzll(x)
#define backzero(x) _builtin_ctzll(x)
#define nli "\n";
 
#ifndef ONLINE_JUDGE
	#define debug(x) cerr<<#x<<" "<<printn(x)<<nli;
#else
	#define debug(x)
#endif
 
void printn(ll x){cerr<<x<<" ";};
void printn(int x){cerr<<x<<" ";};
void printn(double x){cerr<<x<<" ";};
void printn(bool x){cerr<<x<<" ";};
void printn(char x){cerr<<x<<" ";};
void printn(string x){cerr<<x<<" ";};
template<class T> void printn(set<T> s);
template<class T> void printn(vector<T> s);
template<class T,class V> void printn(pair<T, V> s);
template<class T,class V> void printn(map<T, V> s);
template<class T> void printn(set<T> s){cerr<<"{ ";fx(s){printn(x);cerr<<",";};cerr<<"}";}
template<class T> void print(vector<T> s){cerr<<"[ ";fx(s){print(x);cerr<<",";};cerr<<"]";}
template<class T,class V> void print(pair<T,V> s){cerr<<"( ";print(s.ff);cerr<<",";print(s.ss);cerr<<")";}
template<class T,class V> void print(map<T,V> s){cerr<<"[ ";fx(s){print(x);cerr<<",";};cerr<<"]";}
 
const ll mx = 1e5 + 5;
const ll mod = 1e9 + 7;
 
ll n,m,sum,ans,res,cnt,tp,tp2,tptp;
ll sr,de;
ll tnc[mx];
 
int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
		
		cin>>n>>m;
		fip(0,n-1){
			cin>>sr>>de;
		}
		ans = 0;
		fip(0,m){
			cin>>tp;			
			vi a(tp);
			fjp(0,tp){
				cin>>tp2;
				tnc[tp2]++;
			}
			cnt = 0;
			fip(2,n+1){
				if(!tnc[i])cnt++;
				else cnt += tnc[i];
			}
			if(n&1){
				cout<<0<<nli;
				continue;
			}
			ans = 0;			
			fip(2,n+1){
				if(!tnc[i])ans++;
				else if(tnc[i]&1)
					ans += (tnc[i] + 1);
				else
					ans += (tnc[i]+2);
			}
			cout<<ans;
		}
 
	cerr<<"time elapsed: "<<setprecision(6)<<1000.0*clock()/CLOCKS_PER_SEC<<"ms"<<nli;
	return 0;
}

Subtask #1
0 / 0.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 976 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1029 ms 1648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

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