제출 #271735

#제출 시각아이디문제언어결과실행 시간메모리
271735AKaan37Restore Array (RMI19_restore)C++17
0 / 100
20 ms512 KiB
//Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< int,int > PII; typedef pair< int,PII > PIII; typedef pair< int,PIII > PIIII; typedef pair< int,PIIII > PIIIII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=0;i<n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; PIIIII p[li]; string s; vector<int> v; int main(void){ scanf("%d %d",&n,&m); FOR a[i]=-1; for(int i=1;i<=m;i++){ scanf("%d %d %d %d",&p[i].se.se.fi,&p[i].se.se.se.fi,&p[i].se.se.se.se,&p[i].fi); p[i].se.fi=p[i].se.se.se.fi-p[i].se.se.fi+1; } sort(p+1,p+n+1); int ind=-1; for(int i=1;i<=m;i++){ if(p[i].fi==0)continue; if(ind==-1)ind=i-1; for(int j=p[i].se.se.fi;j<=p[i].se.se.se.fi;j++){ a[j]=1; } } if(ind==-1)ind=m; for(int i=1;i<=ind;i++){ int say=0; int tut=0; int boya=-1; for(int j=p[i].se.se.fi;j<=p[i].se.se.se.fi;j++){ if(a[j]==1)say++; if(a[j]==-1)boya=j; tut++; } if(say==tut){printf("-1\n");return 0;} if(say==tut-1 && boya!=-1){ a[boya]=0; } } FOR{ if(a[i]==-1){printf("-1\n");return 0;} } FOR printf("%d ",a[i]); return 0; }

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

restore.cpp: In function 'int main()':
restore.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |  scanf("%d %d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~
restore.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |   scanf("%d %d %d %d",&p[i].se.se.fi,&p[i].se.se.se.fi,&p[i].se.se.se.se,&p[i].fi);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...