Submission #366857

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
366857	2021-02-15 13:11:08	leinad2	조개 줍기 (KOI17_shell)	C++17	0 / 100	812 ms	126188 KiB

shell

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, i, j, k, a, b, B[1510][1510], ans;
char c;
struct tree
{
    int seg[6010], lazy[6010];
    void busy(int id, int s, int e, int m)
    {
        seg[id*2]+=(m-s+1)*lazy[id];
        seg[id*2+1]+=(e-m)*lazy[id];
        lazy[id*2]+=lazy[id];
        lazy[id*2+1]+=lazy[id];
        lazy[id]=0;
    }
    void update(int id, int s, int e, int l, int r, int v)
    {
        if(l>r)return;
        if(e<l||r<s)return;
        if(l<=s&&e<=r)
        {
            seg[id]+=(e-s+1)*v;
            lazy[id]+=v;
            return;
        }
        int m=s+e>>1;
        busy(id, s, e, m);
        update(id*2, s, m, l, r, v);
        update(id*2+1, m+1, e, l, r, v);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

shell.cpp: In member function 'void tree::update(long long int, long long int, long long int, long long int, long long int, long long int)':
shell.cpp:27:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |         int m=s+e>>1;
      |               ~^~
shell.cpp: In member function 'long long int tree::get(long long int, long long int, long long int, long long int, long long int)':
shell.cpp:37:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   37 |         int m=s+e>>1;
      |               ~^~
shell.cpp: At global scope:
shell.cpp:42:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   42 | main()
      |      ^
shell.cpp: In function 'int main()':
shell.cpp:127:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  127 |       for(i=0;i++<n;)ans2+=A[i].get(1, 1, n, 1, n);if(ans!=ans2)for(;;);
      |       ^~~
shell.cpp:127:52: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  127 |       for(i=0;i++<n;)ans2+=A[i].get(1, 1, n, 1, n);if(ans!=ans2)for(;;);
      |                                                    ^~
shell.cpp:127:65: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  127 |       for(i=0;i++<n;)ans2+=A[i].get(1, 1, n, 1, n);if(ans!=ans2)for(;;);
      |                                                                 ^~~
shell.cpp:128:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  128 |         cout<<ans<<"\n";
      |         ^~~~

• Subtask 1: 0 / 12
• Subtask 2: 0 / 34
• Subtask 3: 0 / 54