QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#641774#9245. Bracket Sequence7islandsWA 31ms398856kbC++231.1kb2024-10-14 23:18:382024-10-14 23:18:39

Judging History

This is the latest submission verdict.

  • [2024-10-14 23:18:39]
  • Judged
  • Verdict: WA
  • Time: 31ms
  • Memory: 398856kb
  • [2024-10-14 23:18:38]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int inf=0x3f3f3f3f;
const ll infll=0x3f3f3f3f3f3f3f3f;
#define int long long
#define pii pair <int,int>
#define ld long double
#define endl "\n"
const int N=2000050;
int dp[5050][5050];
int sigma1[5050];
int sigma2[5050];
int tab1[5050][5050];
int tab2[5050][5050];
int a[N];
signed main (){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int n=5000,m=5000;
    // cin >>n>>m;
    for (int i=1;i<=n;i++){
        //cin >>a[i];
        a[i]=0;
    }
    int cnt=0;
    for (int i=1;i<=n;i++){
        if (a[i]==0){
            cnt++;
            for (int i=1;i<=m;i++){
                sigma1[i]+=sigma1[i-1];
                sigma2[i]+=sigma2[i-1];
            }
            for (int i=1;i<=m;i++){
                tab1[cnt][i]=sigma1[i];
                tab2[cnt][i]=sigma2[i];
            }
            for (int i=1;i<=m;i++){
                sigma1[i]=0;
                sigma2[i]=0;
            }
        }
    }
    for (int i=1;i<=n;i++){

    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 31ms
memory: 398856kb

input:

5 20
(()()
1 1 2 1
1 1 3 1
1 1 4 1
1 1 5 1
1 2 3 1
1 2 4 1
1 2 5 1
1 3 4 1
1 3 5 1
1 4 5 1
2 1 3 1
2 1 4 1
2 1 5 1
2 2 3 1
2 2 4 1
2 2 5 1
2 3 5 1
2 4 5 1
1 1 5 2
2 1 5 2

output:


result:

wrong answer 1st lines differ - expected: '0', found: ''