제출 #994719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
994719		jonathanirvings	Jobs (BOI24_jobs)	C++17	100 / 100	302 ms	106784 KiB

Main

//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

// typedef long long LL;
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s);
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s);
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

multiset<pll> grup[300005];
int n;
LL s;
LL x[300005];
vi child[300005];
int p[300005];

void dfs(int u)
{
  int largest = -1;
  for (int v : child[u])
  {
    dfs(v);
    if (largest == -1 || SIZE(grup[v]) > SIZE(grup[largest])) largest = v;
  }
  swap(grup[u],grup[largest]);
  for (int v : child[u]) if (v != largest)
  {
    for (pll now : grup[v]) grup[u].insert(now);
  }
  LL req = max(0LL,-x[u]);
  LL profit = x[u];
  while (profit < 0 && SIZE(grup[u]))
  {
    pll now = *(grup[u].begin());
    grup[u].erase(grup[u].begin());
    MAX(req,now.fi - profit);
    profit += now.se;
  }
  if (profit >= 0)
  {
    while (SIZE(grup[u]) && grup[u].begin()->fi < req)
    {
      profit += grup[u].begin()->se;
      grup[u].erase(grup[u].begin());
    }
    grup[u].insert(mp(req,profit));
  }
}

int main()
{
  scanf("%d %lld",&n,&s);
  ++n;
  FOR(i,1,n)
  {
    scanf("%lld %d",&x[i],&p[i]);
    child[p[i]].pb(i);
  }
  dfs(0);
  LL uang = s;
  for (pll now : grup[0]) if (uang >= now.fi) uang += now.se;
  printf("%lld\n",uang - s);
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'std::string uppercase(std::string)':
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:40:18: note: in expansion of macro 'FOR'
   40 | #define REP(i,n) FOR(i,0,n)
      |                  ^~~
Main.cpp:80:3: note: in expansion of macro 'REP'
   80 |   REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
      |   ^~~
Main.cpp: In function 'std::string lowercase(std::string)':
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:40:18: note: in expansion of macro 'FOR'
   40 | #define REP(i,n) FOR(i,0,n)
      |                  ^~~
Main.cpp:86:3: note: in expansion of macro 'REP'
   86 |   REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
      |   ^~~
Main.cpp: In function 'int main()':
Main.cpp:34:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   34 | #define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
      |                             ^
Main.cpp:143:3: note: in expansion of macro 'FOR'
  143 |   FOR(i,1,n)
      |   ^~~
Main.cpp:141:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  141 |   scanf("%d %lld",&n,&s);
      |   ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp:145:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |     scanf("%lld %d",&x[i],&p[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 29 / 29
• Subtask 5: 31 / 31