oj.uz

답안 #1111474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1111474 2024-11-12T08:47:44 Z modwwe JOIOJI (JOI14_joioji) C++17
95 / 100
 37 ms 7480 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf = 1e14;
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
ll n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r;
int kk;
int el = 19;
main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        //  fou(task);
    }
    NHP
    /// cin>>s1;
   // modwwe
    phongbeo(),down
    // checktime
}
int a[200001];
int c[3];
set<pair<pair<int,int>,int>>p;
void phongbeo()
{
 cin>>n;
    string s;
 cin>>s;
 s=" "+s;
  for(int i=1;i<=n;i++){
  if(s[i]=='J')a[i]=0;
  else if(s[i]=='O') a[i]=1;
   else a[i]=2;
     }
 p.insert({{0,0},0});
      for(int i=1;i<=n;i++)
      {
        c[a[i]]++;
        s2=c[0]-c[2];
        s3=c[0]-c[1];
        pair<pair<int,int>,int> x=*p.lower_bound({{s2,s3},0});
        if(x.first==make_pair(s2,s3))s4=max(s4,i-x.second);
       else p.insert({{s2,s3},i});
      }
       cout<<s4;
}

Compilation message

joioji.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main()
      | ^~~~
joioji.cpp: In function 'int main()':
joioji.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
joioji.cpp:61:9: note: in expansion of macro 'fin'
   61 |         fin(task);
      |         ^~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 592 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 7 ms 1360 KB Output is correct
3 Correct 8 ms 1884 KB Output is correct
4 Correct 13 ms 3136 KB Output is correct
5 Correct 21 ms 4680 KB Output is correct
6 Correct 28 ms 5288 KB Output is correct
7 Correct 25 ms 5608 KB Output is correct
8 Correct 24 ms 5156 KB Output is correct
9 Correct 26 ms 5400 KB Output is correct
10 Correct 26 ms 5136 KB Output is correct
11 Correct 37 ms 6696 KB Output is correct
12 Correct 16 ms 3880 KB Output is correct
13 Correct 14 ms 3104 KB Output is correct
14 Correct 31 ms 7480 KB Output is correct
15 Correct 16 ms 2860 KB Output is correct