제출 #132121

#제출 시각아이디문제언어결과실행 시간메모리
132121MvC가로등 (APIO19_street_lamps)C++11
20 / 100
182 ms1472 KiB
#pragma GCC target("avx2") #pragma GCC optimization("O3") #pragma GCC optimization("unroll-loops") #include<bits/stdc++.h> //#include "aliens.h" #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=1e2+50; const int mod=1e9+7; using namespace std; int n,q,a[nmax],nr[nmax][nmax],x,y,i,j; string s; char c; int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); cin>>n>>q; for(i=1;i<=n;i++) { cin>>c; a[i]=c-'0'; } while(q--) { for(i=1;i<=n;i++) { for(j=i;j<=n;j++) { if(!a[j])break; nr[i][j]++; } } cin>>s; if(s[0]=='t') { cin>>x; a[x]^=1; } else { cin>>x>>y; cout<<nr[x][y-1]<<'\n'; } } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

street_lamps.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
street_lamps.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...