/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 584.0 KiB
#2 Accepted 1ms 580.0 KiB
#3 Accepted 2ms 584.0 KiB
#4 Accepted 2ms 580.0 KiB
#5 Accepted 3ms 580.0 KiB
#6 Accepted 3ms 1.062 MiB
#7 Accepted 1ms 576.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 1e4 + 3, mod = 1e9 + 7;
int dp[3][mxn], vis[3][mxn];
int n, ar[mxn];
int rec(int idx, int mo)
{
    if(idx == n)return (!mo ? 0 : -1e9);
    if(vis[mo][idx] == cs)return dp[mo][idx];
    vis[mo][idx] = cs;

    int ans = 1 + rec(idx + 1, (mo + ar[idx]) % 3);
    ans = max(ans, rec(idx + 1, mo));
    return dp[mo][idx] = ans;
}
int32_t main()
{

    fast
    w(t)
    {
        cin >> n;
        cs++;
        for(int i = 0; i < n; i++)cin >> ar[i];
        cout << rec(0, 0) << endl;
    }
}

Information

Submit By
Type
Submission
Problem
P1013 Divisible by 3
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-08 06:04:19
Judged At
2024-11-11 02:22:51
Judged By
Score
100
Total Time
3ms
Peak Memory
1.062 MiB