Codeforces Round #436 (Div. 2), problem: (E) Fire Solution In C/C++
#include<iostream> #include<cstdio> #include<algorithm> #include<bitset> using namespace std; struct node{ int t,d,p,tot; }a; int f; bool cmp(node x,node y){ return x.d<y.d; } bitset<150> ans; int cc; int main(){ int n; scanf(“%d”,&n); for (int i=1;i<=n;++i){ scanf(“%d%d%d”,&a.t,&a.d,&a.p); a.tot=i; …