oj.uz

답안 #1087090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087090 2024-09-12T08:03:06 Z ezluci Feast (NOI19_feast) C++17
100 / 100
 86 ms 40320 KB 
#ifdef EZ
   #include "./ez/ez.h"
#else
   #include <bits/stdc++.h>
#endif
#define mp make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
void EZinit() {
   #ifndef EZ
   //cin.tie(0)->sync_with_stdio(0);
   #else
   freopen("test.in", "r", stdin);
   freopen("test.out", "w", stdout);
   #endif
}

/*
vom afla raspunsul secvential: j=1,2,..k secvente. pt j=1 folosim cea mai mare subsecventa initial.
pt a trece de la j-1 la j, ori folosim o noua subsecventa, ori
   spargem o subsecventa deja folosita (scoatem sub-subsecventa de suma MINIMA).
*/


class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(FILE *stream) {
		fin = stream;
		buff = new char[4096]();
		sp = 4095;
	}
	
	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

int n, k;
int v[300001];
ll sp[600001];
#define sum(x,y) (sp[y]-sp[(x)-1])


struct alexaint {
   int x, y, xp, xs;
};
const int ainth = 19;
const int aintlim = 1<<ainth;
alexaint aintmi[2*aintlim], aintma[2*aintlim];

alexaint Q; ll a, b, c;
inline alexaint combinemi(alexaint &A, alexaint &B, int st, int dr)
{
   a = sum(st, A.xp);   b = sum(st, B.xp);
   Q.xp = (a<=b ? A.xp : B.xp);
   
   a = sum(B.xs, dr);   b = sum(A.xs, dr);
   Q.xs = (a<=b ? B.xs : A.xs);

   a = sum(A.x, A.y);   b = sum(B.x, B.y);   c = sum(A.xs, B.xp);
   if (a <= min(b,c))   Q.x = A.x,  Q.y = A.y;
   else if (b <= min(a,c)) Q.x = B.x,  Q.y = B.y;
   else  Q.x = A.xs, Q.y = B.xp;

   return Q;
}
inline alexaint combinema(alexaint &A, alexaint &B, int st, int dr)
{
   a = sum(st, A.xp);   b = sum(st, B.xp);
   Q.xp = (a>=b ? A.xp : B.xp);
   
   a = sum(B.xs, dr);   b = sum(A.xs, dr);
   Q.xs = (a>=b ? B.xs : A.xs);

   a = sum(A.x, A.y);   b = sum(B.x, B.y);   c = sum(A.xs, B.xp);
   if (a >= max(b,c))   Q.x = A.x,  Q.y = A.y;
   else if (b >= max(a,c)) Q.x = B.x,  Q.y = B.y;
   else  Q.x = A.xs, Q.y = B.xp;

   return Q;
}

void build(int nod = 1, int st = 1, int dr = aintlim)
{
   if (st == dr)  return (void) (aintma[nod] = aintmi[nod] = {st, st, st, st});
   int mj = st+dr >> 1;
   build(nod*2, st, mj);
   build(nod*2+1, mj+1, dr);
   aintma[nod] = combinema(aintma[nod*2], aintma[nod*2+1], st, dr);
   aintmi[nod] = combinemi(aintmi[nod*2], aintmi[nod*2+1], st, dr);
}

alexaint ansst, ansdr;  bool minmx;
inline alexaint que(int qst, int qdr)
{
   int QST = qst, QDR = qdr;
   if (qst == qdr)   return {qst, qst, qst, qst};
   ansst.x = ansst.y = ansst.xp = ansst.xs = qst;
   ansdr.x = ansdr.y = ansdr.xp = ansdr.xs = qdr;
   qst += aintlim-1;
   qdr += aintlim-1;
   qst++;   qdr--;
   if (minmx)
   {
      for (; qst <= qdr; qst >>= 1, qdr >>= 1)
      {
         if (qst&1)
            ansst = combinemi(ansst, aintmi[qst], QST, (qst+1-(1<<__lg(qst)))*(1<<ainth-__lg(qst))),
            qst++;
         if (!(qdr&1))
            ansdr = combinemi(aintmi[qdr], ansdr, 1 + (qdr-(1<<__lg(qdr)))*(1<<ainth-__lg(qdr)), QDR),
            qdr--;
      }
      return combinemi(ansst, ansdr, QST, QDR);
   }
   else
   {
      for (; qst <= qdr; qst >>= 1, qdr >>= 1)
      {
         if (qst&1)
            ansst = combinema(ansst, aintma[qst], QST, (qst+1-(1<<__lg(qst)))*(1<<ainth-__lg(qst))),
            qst++;
         if (!(qdr&1))
            ansdr = combinema(aintma[qdr], ansdr, 1 + (qdr-(1<<__lg(qdr)))*(1<<ainth-__lg(qdr)), QDR),
            qdr--;
      }
      return combinema(ansst, ansdr, QST, QDR);
   }
}


struct alexmax {
   int fi, se, bfi, bse;
   bool operator<(const alexmax &B) const
      { return sum(bfi,bse) < sum(B.bfi,B.bse); }
};
struct alexmin {
   int fi, se, bfi, bse;
   bool operator<(const alexmin &B) const
      { return sum(bfi,bse) > sum(B.bfi,B.bse); }
};


int main()
{
   EZinit();
   InParser fin(stdin);

   fin >> n >> k;
   for (int i = 1; i <= n; ++i)  fin >> v[i],   sp[i] = sp[i-1] + v[i];

   build();

   ll ans = 0;
   priority_queue<alexmin> ivuse;
   priority_queue<alexmax> ivno;
   minmx = false; auto q = que(1, n);
   if (sum(q.x, q.y) >= 1) ivno.push({1, n, q.x, q.y});
   for (int j = 1; j <= k; ++j)
   {
      // ce putem scoate
      ll Ss = LLONG_MAX;   int xs, ys, Xs, Ys;
      if (!ivuse.empty())
      {
         xs = ivuse.top().fi, ys = ivuse.top().se;
         Xs = ivuse.top().bfi,   Ys = ivuse.top().bse;
         Ss = sum(Xs,Ys);
      }
      // ce putem pune
      ll Sp = LLONG_MIN;   int xp, yp, Xp, Yp;
      if (!ivno.empty())
      {
         xp = ivno.top().fi,  yp = ivno.top().se;
         Xp = ivno.top().bfi, Yp = ivno.top().bse;
         Sp = sum(Xp,Yp);
      }

      if (Ss != LLONG_MAX && (-Ss > Sp || Sp == LLONG_MIN))
      { // scoatem
         ivuse.pop();
         if (xs != Xs)
         {
            minmx = true; q = que(xs, Xs-1);
            if (sum(q.x, q.y) <= -1)   ivuse.push({xs, Xs-1, q.x, q.y});
         }
         if (ys != Ys)
         {
            minmx = true; q = que(Ys+1, ys);
            if (sum(q.x, q.y) <= -1)   ivuse.push({Ys+1, ys, q.x, q.y});
         }
         minmx = false;  q = que(Xs, Ys);
         if (sum(q.x, q.y) >= 1)   ivno.push({Xs, Ys, q.x, q.y});
         ans += -Ss;
      }
      else if (Sp != LLONG_MIN && (Sp >= -Ss || Ss == LLONG_MAX))
      { // punem
         ivno.pop();
         if (xp != Xp)
         {
            minmx = false; q = que(xp, Xp-1);
            if (sum(q.x, q.y) >= 1) ivno.push({xp, Xp-1, q.x, q.y});
         }
         if (yp != Yp)
         {
            minmx = false; q = que(Yp+1, yp);
            if (sum(q.x, q.y) >= 1) ivno.push({Yp+1, yp, q.x, q.y});
         }
         minmx = true;  q = que(Xp, Yp);
         if (sum(q.x, q.y) <= -1)   ivuse.push({Xp, Yp, q.x, q.y});
         ans += Sp;
      }
      else  break;
   }

   cout << ans << '\n';
}

Compilation message

feast.cpp: In function 'void build(int, int, int)':
feast.cpp:116:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  116 |    int mj = st+dr >> 1;
      |             ~~^~~
feast.cpp: In function 'alexaint que(int, int)':
feast.cpp:138:88: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  138 |             ansst = combinemi(ansst, aintmi[qst], QST, (qst+1-(1<<__lg(qst)))*(1<<ainth-__lg(qst))),
      |                                                                                   ~~~~~^~~~~~~~~~
feast.cpp:141:85: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  141 |             ansdr = combinemi(aintmi[qdr], ansdr, 1 + (qdr-(1<<__lg(qdr)))*(1<<ainth-__lg(qdr)), QDR),
      |                                                                                ~~~~~^~~~~~~~~~
feast.cpp:151:88: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  151 |             ansst = combinema(ansst, aintma[qst], QST, (qst+1-(1<<__lg(qst)))*(1<<ainth-__lg(qst))),
      |                                                                                   ~~~~~^~~~~~~~~~
feast.cpp:154:85: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  154 |             ansdr = combinema(aintma[qdr], ansdr, 1 + (qdr-(1<<__lg(qdr)))*(1<<ainth-__lg(qdr)), QDR),
      |                                                                                ~~~~~^~~~~~~~~~
feast.cpp: In member function 'char InParser::read_ch()':
feast.cpp:38:9: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |    fread(buff, 1, 4096, fin);
      |    ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 39332 KB Output is correct
2 Correct 29 ms 39440 KB Output is correct
3 Correct 30 ms 39628 KB Output is correct
4 Correct 29 ms 39484 KB Output is correct
5 Correct 30 ms 39420 KB Output is correct
6 Correct 30 ms 39364 KB Output is correct
7 Correct 29 ms 39252 KB Output is correct
8 Correct 31 ms 39392 KB Output is correct
9 Correct 27 ms 39448 KB Output is correct
10 Correct 34 ms 39364 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 37716 KB Output is correct
2 Correct 26 ms 37896 KB Output is correct
3 Correct 26 ms 37784 KB Output is correct
4 Correct 25 ms 37724 KB Output is correct
5 Correct 41 ms 39248 KB Output is correct
6 Correct 26 ms 37720 KB Output is correct
7 Correct 27 ms 37720 KB Output is correct
8 Correct 31 ms 39464 KB Output is correct
9 Correct 29 ms 39344 KB Output is correct
10 Correct 37 ms 37864 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 39632 KB Output is correct
2 Correct 31 ms 39504 KB Output is correct
3 Correct 31 ms 39508 KB Output is correct
4 Correct 34 ms 39564 KB Output is correct
5 Correct 33 ms 39560 KB Output is correct
6 Correct 33 ms 39764 KB Output is correct
7 Correct 33 ms 39620 KB Output is correct
8 Correct 46 ms 39508 KB Output is correct
9 Correct 31 ms 39760 KB Output is correct
10 Correct 34 ms 39608 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 33264 KB Output is correct
2 Correct 31 ms 33080 KB Output is correct
3 Correct 31 ms 33116 KB Output is correct
4 Correct 28 ms 33112 KB Output is correct
5 Correct 22 ms 33236 KB Output is correct
6 Correct 23 ms 33116 KB Output is correct
7 Correct 22 ms 33116 KB Output is correct
8 Correct 30 ms 33116 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 21 ms 33116 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 33264 KB Output is correct
2 Correct 31 ms 33080 KB Output is correct
3 Correct 31 ms 33116 KB Output is correct
4 Correct 28 ms 33112 KB Output is correct
5 Correct 22 ms 33236 KB Output is correct
6 Correct 23 ms 33116 KB Output is correct
7 Correct 22 ms 33116 KB Output is correct
8 Correct 30 ms 33116 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 21 ms 33116 KB Output is correct
11 Correct 26 ms 33216 KB Output is correct
12 Correct 25 ms 33224 KB Output is correct
13 Correct 23 ms 33100 KB Output is correct
14 Correct 22 ms 33064 KB Output is correct
15 Correct 25 ms 33292 KB Output is correct
16 Correct 22 ms 33108 KB Output is correct
17 Correct 21 ms 33112 KB Output is correct
18 Correct 22 ms 33140 KB Output is correct
19 Correct 22 ms 33120 KB Output is correct
20 Correct 21 ms 33116 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 33264 KB Output is correct
2 Correct 31 ms 33080 KB Output is correct
3 Correct 31 ms 33116 KB Output is correct
4 Correct 28 ms 33112 KB Output is correct
5 Correct 22 ms 33236 KB Output is correct
6 Correct 23 ms 33116 KB Output is correct
7 Correct 22 ms 33116 KB Output is correct
8 Correct 30 ms 33116 KB Output is correct
9 Correct 22 ms 33124 KB Output is correct
10 Correct 21 ms 33116 KB Output is correct
11 Correct 26 ms 33216 KB Output is correct
12 Correct 25 ms 33224 KB Output is correct
13 Correct 23 ms 33100 KB Output is correct
14 Correct 22 ms 33064 KB Output is correct
15 Correct 25 ms 33292 KB Output is correct
16 Correct 22 ms 33108 KB Output is correct
17 Correct 21 ms 33112 KB Output is correct
18 Correct 22 ms 33140 KB Output is correct
19 Correct 22 ms 33120 KB Output is correct
20 Correct 21 ms 33116 KB Output is correct
21 Correct 29 ms 33112 KB Output is correct
22 Correct 21 ms 33148 KB Output is correct
23 Correct 21 ms 33104 KB Output is correct
24 Correct 21 ms 33116 KB Output is correct
25 Correct 23 ms 33108 KB Output is correct
26 Correct 31 ms 33172 KB Output is correct
27 Correct 23 ms 33292 KB Output is correct
28 Correct 24 ms 33120 KB Output is correct
29 Correct 23 ms 33116 KB Output is correct
30 Correct 32 ms 33228 KB Output is correct

Subtask #7
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 39332 KB Output is correct
2 Correct 29 ms 39440 KB Output is correct
3 Correct 30 ms 39628 KB Output is correct
4 Correct 29 ms 39484 KB Output is correct
5 Correct 30 ms 39420 KB Output is correct
6 Correct 30 ms 39364 KB Output is correct
7 Correct 29 ms 39252 KB Output is correct
8 Correct 31 ms 39392 KB Output is correct
9 Correct 27 ms 39448 KB Output is correct
10 Correct 34 ms 39364 KB Output is correct
11 Correct 26 ms 37716 KB Output is correct
12 Correct 26 ms 37896 KB Output is correct
13 Correct 26 ms 37784 KB Output is correct
14 Correct 25 ms 37724 KB Output is correct
15 Correct 41 ms 39248 KB Output is correct
16 Correct 26 ms 37720 KB Output is correct
17 Correct 27 ms 37720 KB Output is correct
18 Correct 31 ms 39464 KB Output is correct
19 Correct 29 ms 39344 KB Output is correct
20 Correct 37 ms 37864 KB Output is correct
21 Correct 37 ms 39632 KB Output is correct
22 Correct 31 ms 39504 KB Output is correct
23 Correct 31 ms 39508 KB Output is correct
24 Correct 34 ms 39564 KB Output is correct
25 Correct 33 ms 39560 KB Output is correct
26 Correct 33 ms 39764 KB Output is correct
27 Correct 33 ms 39620 KB Output is correct
28 Correct 46 ms 39508 KB Output is correct
29 Correct 31 ms 39760 KB Output is correct
30 Correct 34 ms 39608 KB Output is correct
31 Correct 33 ms 33264 KB Output is correct
32 Correct 31 ms 33080 KB Output is correct
33 Correct 31 ms 33116 KB Output is correct
34 Correct 28 ms 33112 KB Output is correct
35 Correct 22 ms 33236 KB Output is correct
36 Correct 23 ms 33116 KB Output is correct
37 Correct 22 ms 33116 KB Output is correct
38 Correct 30 ms 33116 KB Output is correct
39 Correct 22 ms 33124 KB Output is correct
40 Correct 21 ms 33116 KB Output is correct
41 Correct 26 ms 33216 KB Output is correct
42 Correct 25 ms 33224 KB Output is correct
43 Correct 23 ms 33100 KB Output is correct
44 Correct 22 ms 33064 KB Output is correct
45 Correct 25 ms 33292 KB Output is correct
46 Correct 22 ms 33108 KB Output is correct
47 Correct 21 ms 33112 KB Output is correct
48 Correct 22 ms 33140 KB Output is correct
49 Correct 22 ms 33120 KB Output is correct
50 Correct 21 ms 33116 KB Output is correct
51 Correct 29 ms 33112 KB Output is correct
52 Correct 21 ms 33148 KB Output is correct
53 Correct 21 ms 33104 KB Output is correct
54 Correct 21 ms 33116 KB Output is correct
55 Correct 23 ms 33108 KB Output is correct
56 Correct 31 ms 33172 KB Output is correct
57 Correct 23 ms 33292 KB Output is correct
58 Correct 24 ms 33120 KB Output is correct
59 Correct 23 ms 33116 KB Output is correct
60 Correct 32 ms 33228 KB Output is correct
61 Correct 63 ms 40192 KB Output is correct
62 Correct 86 ms 40316 KB Output is correct
63 Correct 44 ms 39884 KB Output is correct
64 Correct 67 ms 40320 KB Output is correct
65 Correct 59 ms 40304 KB Output is correct
66 Correct 64 ms 40188 KB Output is correct
67 Correct 53 ms 40100 KB Output is correct
68 Correct 32 ms 39688 KB Output is correct
69 Correct 34 ms 39512 KB Output is correct
70 Correct 32 ms 39504 KB Output is correct