Submission #7957710


Source Code Expand

Copy
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

// Union find
struct uf {
  vi d;
  uf(){}
  uf(int mx):d(mx,-1){}
  int root(int x) {
    if(d[x] < 0) return x;
    return d[x] = root(d[x]);
  }
  bool unite(int x, int y) {
    x = root(x); y = root(y);
    if(x == y) return false;
    if(d[x] > d[y]) swap(x,y);
    d[x] += d[y]; d[y] = x;
    return true;
  }
  int size(int x) { return -d[root(x)];}
  int operator[](int x) { return root(x);}
  int operator()(int x) { return size(x);}
};
//



int main() {
  int n,m,w;
  scanf("%d%d%d",&n,&m,&w);
  vp p(n);
  cin>>p;
  uf t(n);
  rep(i,m) {
    int a,b;
    scanf("%d%d",&a,&b);
    --a; --b;
    t.unite(a,b);
  }
  vp a(n);
  rep(i,n) {
    int ai = t[i];
    a[ai].fi += p[i].fi;
    a[ai].se += p[i].se;
  }

  vi dp(w+1);
  rep(i,n) {
    if (!a[i].fi) continue;
    drep(j,w+1) {
      int nj = j-a[i].fi;
      if (nj < 0) break;
      maxs(dp[j],dp[nj]+a[i].se);
    }
  }
  cout<<dp.back()<<endl;
  return 0;
}




















Submission Info

Submission Time
Task B - ナップサック問題
User snuke
Language C++14 (GCC 5.4.1)
Score 200
Code Size 3202 Byte
Status
Exec Time 2 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:84:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&n,&m,&w);
                           ^
./Main.cpp:90:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&a,&b);
                        ^

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_sample_00, 0_sample_01, 0_sample_02, 0_sample_03
All 200 / 200 0_sample_00, 0_sample_01, 0_sample_02, 0_sample_03, 1_random_00, 1_random_01, 1_random_02, 1_random_03, 1_random_04, 1_random_05, 1_random_06, 1_random_07, 1_random_08, 1_random_09, 1_random_10, 1_random_11, 1_random_12, 1_random_13, 1_random_14, 1_random_15, 1_random_16, 1_random_17, 1_random_18, 1_random_19, 2_maximum
Case Name Status Exec Time Memory
0_sample_00 1 ms 256 KB
0_sample_01 1 ms 256 KB
0_sample_02 1 ms 256 KB
0_sample_03 1 ms 256 KB
1_random_00 1 ms 256 KB
1_random_01 2 ms 256 KB
1_random_02 1 ms 256 KB
1_random_03 2 ms 256 KB
1_random_04 1 ms 256 KB
1_random_05 1 ms 256 KB
1_random_06 1 ms 256 KB
1_random_07 1 ms 256 KB
1_random_08 2 ms 256 KB
1_random_09 2 ms 256 KB
1_random_10 1 ms 256 KB
1_random_11 2 ms 256 KB
1_random_12 2 ms 256 KB
1_random_13 1 ms 256 KB
1_random_14 2 ms 256 KB
1_random_15 1 ms 256 KB
1_random_16 2 ms 256 KB
1_random_17 1 ms 256 KB
1_random_18 2 ms 256 KB
1_random_19 2 ms 256 KB
2_maximum 2 ms 256 KB