oj.uz

Submission #529804

# Submission time Handle Problem Language Result Execution time Memory
529804 2022-02-23T17:28:48 Z ammar2000 Street Lamps (APIO19_street_lamps) C++17
40 / 100
 104 ms 20576 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,q,las[SI],ans[SI];
string s,c[SI];
int main()
{
   fast
   cin>>n>>q>>s;
   if (n<=100&&q<=100)
   {
       c[0]=s;
       for (int i=1;i<=q;i++)
       {
           c[i]=c[i-1];
           string info;
           cin>>info;
           if (info=="toggle")
           {
               ll in;
               cin>>in;
               if (c[i][in-1]=='1')
               c[i][in-1]='0';
               else c[i][in-1]='1';
               continue ;
           }
           else
           {
               ll a,b;
               cin>>a>>b;
               a--;
               b--;
               ll cou=0;
               for (int u=0;u<i;u++)
               {
                   bool fl=0;
                   for (int e=a;e<b;e++)
                    if (c[u][e]=='0')
                    fl=1;
                    if (!fl) cou++;
               }
               cout <<cou <<"\n";
           }
       }
   }
   else
   {
       s='*'+s;
       for (int i=1;i<=n;i++)
        if (s[i]=='1')
         las[i]=0;
        else las[i]=INF;
        for (int i=1;i<=q;i++)
        {
            string info;
           cin>>info;
           if (info=="toggle")
           {
               ll in;
               cin>>in;
               if (s[in]=='1')
               {
                   ans[in]+=max(0ll,i-las[in]);
                   s[in]='0';
               }
               else
               {
                   las[in]=i;
                   s[in]='1';
               }
           }
           else
           {
               ll in,qw;
               cin>>in>>qw;
               ll cou=ans[in];
               if (s[in]=='1')
                cou+=i-las[in];
               cout << cou<<"\n";
           }
        }
   }
   // use scanf not cin
   return 0;
}

Compilation message

street_lamps.cpp: In function 'int main()':
street_lamps.cpp:51:20: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   51 |                    for (int e=a;e<b;e++)
      |                    ^~~
street_lamps.cpp:54:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   54 |                     if (!fl) cou++;
      |                     ^~
street_lamps.cpp:63:8: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   63 |        for (int i=1;i<=n;i++)
      |        ^~~
street_lamps.cpp:67:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   67 |         for (int i=1;i<=q;i++)
      |         ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9604 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 10640 KB Output is correct
2 Correct 71 ms 14148 KB Output is correct
3 Correct 71 ms 14728 KB Output is correct
4 Correct 104 ms 20576 KB Output is correct
5 Correct 100 ms 18720 KB Output is correct
6 Correct 85 ms 20400 KB Output is correct
7 Correct 95 ms 19016 KB Output is correct
8 Correct 101 ms 20420 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 9676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 9628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9604 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 5 ms 9676 KB Output is correct
7 Correct 5 ms 9676 KB Output is correct
8 Correct 68 ms 10640 KB Output is correct
9 Correct 71 ms 14148 KB Output is correct
10 Correct 71 ms 14728 KB Output is correct
11 Correct 104 ms 20576 KB Output is correct
12 Correct 100 ms 18720 KB Output is correct
13 Correct 85 ms 20400 KB Output is correct
14 Correct 95 ms 19016 KB Output is correct
15 Correct 101 ms 20420 KB Output is correct
16 Incorrect 5 ms 9676 KB Output isn't correct
17 Halted 0 ms 0 KB -